Given two numbers n and k, change the kth bit of the number n to '0' if it is '1', else return the number n itself.
First line of the input contains an intger T denoting the number of test case. Each test contains a single line containg two space seperated integers n and k respectively.
For each test case output a single integer.
Test Case 1: n = 13 ('1101') k=3
Test Case 2: n = 13('1101') k=2
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.