# Kill K^{th} Bit

In order to stop the Mad Coder evil genius, you need to decipher the encrypted message he sent to his minions. The message contains several numbers that, when typed into a supercomputer, will launch a missile into the sky blocking out the sun, and making all the people on Earth grumpy and sad.

You figured out that some numbers have a modified single digit in their binary representation. More specifically, in the given number `n`

the `k`

bit from the right was initially set to ^{th}`0`

, but its current value might be different. It's now up to you to write a function that will change the `k`

bit of ^{th}`n`

back to `0`

.

## Example

For

`n = 37`

and`k = 3`

, the output should be`kill_kth_bit(n, k) = 33`

`37`

._{10}= 100**1**01_{2}~> 100**0**01_{2}= 33_{10}For

`n = 37`

and`k = 4`

, the output should be`kill_kth_bit(n, k) = 37`

The

`4`

bit is^{th}`0`

already (looks like the Mad Coder forgot to encrypt this number), so the answer is still`37`

.

## Input/Output

**[input] integer n***Guaranteed constraints:*`0 ≤ n ≤ 2`

.^{31}- 1**[input] integer k**The

`1`

-based index of the changed bit (counting from the right).*Guaranteed constraints:*`1 ≤ k ≤ 31`

.

## Solution

```
def kill_kth_bit(n, k):
return n & ~(1 << (k - 1))
print(kill_kth_bit(37, 3))
```