A. Modular Exponentiationtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe following problem is well-known: given integers n and m, calculate , where 2n = 2·2·...·2 (n factors), and  denotes the remainder of division of x by y.You are asked to solve the "reverse" problem. Given integers n and m, calculate . InputThe first line contains a single integer n (1 ≤ n ≤ 108).The second line contains a single integer m (1 ≤ m ≤ 108).OutputOutput a single integer — the value of .ExamplesInput442Output10Input158Output0Input9876543223456789Output23456789NoteIn the first example, the remainder of division of 42 by 24 = 16 is equal to 10.In the second example, 58 is divisible by 21 = 2 without remainder, and the answer is 0.
Input442
Output10
['implementation', 'math', '*900']