Modular Exponentiation

1000ms

262144K

Description:

The following problem is well-known: given integers n and m, calculate

$\text{[math]}$ ,

where 2ⁿ = 2·2·...·2 (n factors), and $\text{[math]}$ denotes the remainder of division of x by y.

You are asked to solve the "reverse" problem. Given integers n and m, calculate

$\text{[math]}$ .

The first line contains a single integer n (1 ≤ n ≤ 10⁸).

The second line contains a single integer m (1 ≤ m ≤ 10⁸).

Output a single integer — the value of $\text{[math]}$ .

4
42

1
58

98765432
23456789

23456789

In the first example, the remainder of division of 42 by 2⁴ = 16 is equal to 10.

In the second example, 58 is divisible by 2¹ = 2 without remainder, and the answer is 0.

Informação

Provedor Codeforces

Código CF913A