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.
Two numbers n (0 ≤ n ≤ 2^31
- 1) and k (0 ≤ k ≤ 30).
Print the result of resetting k last bits.