Given two integers n and k. Reset (set to zero) the last k bits in the number n, and print the result. It is recommended to find solution without loops.

Input

Two numbers n (0 ≤ n ≤ 231 - 1) and k (0 ≤ k ≤ 30).

Output

Print the result of resetting k last bits.