Modular Exponentiation
Problem
Given integers n and m, calculate:
m MOD (2n)
Input
The first line contains a single integer n (1 ≤ n ≤ 108).
The second line contains a single integer m (1 ≤ m ≤ 108).
Output
Output a single integer — the value of m MOD 2n
Input
1
58
Output
0
Explanation:
In the example, 58 is divisible by 21 = 2 without remainder, and the answer is 0.
Time Limit: 0.2
Memory Limit: 256
Source Limit:
Explanation
In the example, the remainder of division of 42 by 24 = 16 is equal to 10.
