The little boys and little girls of Sydney are excited about the opening of LOLLIPOPS, SWEETS AND CHOCOLATES (LSC), a world renowned candy shop! There are going to be N new branches of LSC opening along the Australian Ice-cream and Oreo Crescent (AIOC). There are L positions on the crescent, each of which can be represented by a number between 1 and L. To promote this, the organisers prepared personalised pamphlets so that for each position on the crescent, the pamphlet lists the N branches in order of how close each shop is to that position. If there are ties, the shops could be listed in any order.
For example, in the diagram above the pamphlet at position 9 could read:
Shop 6: distance 1km
Shop 1: distance 1km
Shop 3: distance 3km
Shop 5: distance 3km
Shop 4: distance 7km
Shop 2: distance 9km
As you were daydreaming about the mouthwatering chlorosulfonic acid sorbet you had last time, you accidentally stepped on a LSC pamphlet! Unfortunately, the stain from your shoe covered up all the distances to the LSCs. In order to satisfy your curiosity, you wish to find a possible position where this pamphlet could have originally been handed out. However LSC is not renowned for their pamphlets' accuracy, so it could be the case that there are no possible positions from where the flyer could have originated.
The next line of input will contain N integers, the ith of which describes the position of the ith shop. For each shop, you are guaranteed that the position of that shop will be an even integer.
The next line of input will contain a permutation of the integers 1 to N: a list of these shops sorted in increasing order based on the distance from the position at which the pamphlet was handed out.
6 18 8 18 6 2 12 10 6 1 3 5 4 2
4 10 2 4 6 8 2 4 1 3
Sample input 1 corresponds to the scenario described above in the problem statement. From position 9, shop 1 and 6 are 1 unit away, shop 3 and 5 are 3 units away, shop 4 is 7 units away and shop 2 is 9 units away. In sample input 2, there is no position that is consistent with the positions of the shops.
For all subtasks, 1 ≤ L ≤ 109 and 1 ≤ N ≤ 100 000. Further, all the positions of shops will be distinct.