A chain of n relay towers broadcasts on n distinct integer frequencies. A technician injects a signal at a starting frequency, original, into the chain. Whenever the signal's current frequency exactly matches the frequency broadcast by one of the towers, that tower amplifies the signal and doubles its frequency; the resulting frequency is then checked again against every tower, and the doubling repeats for as long as the current frequency keeps matching some tower. The moment the current frequency no longer matches any tower's frequency, the process stops for good. Determine the signal's final frequency.

Input format

• Line 1: two integers n and original.
• Line 2: n distinct integers, the tower frequencies, space separated.

Output format

A single integer: the final frequency of the signal. Because repeated doubling can produce a value far larger than any input bound, print the exact integer value (do not round or use floating point).

Constraints

• 1 <= n <= 1000
• 1 <= towers[i] <= 1000, and all towers[i] are distinct
• 1 <= original <= 1000

5 3
5 3 6 1 12

24

4 8
2 4 6 10

8