# Flip given bits

Easy
0/40
Average time to solve is 15m

## Problem statement

You have been given an integer 'NUM' (32 bits) and an array of size 'N'.

Your task is to flip all the bits of 'NUM' at position 'ARR[i]' where 0<= i <= N-1.

Detailed explanation ( Input/output format, Notes, Images )
Input format :
``````The first line contains an Integer 'T' which denotes the number of test cases or queries to be run. Then the test cases follow.

The first line of each test case contains an integer 'NUM' representing the number whose binary representation is to be flipped.

The second line of each test case contains an integer 'N' representing the size of the array/list.

The third line of each test case contains 'N' single space-separated integers representing the elements of the given array/list ‘ARR’.
``````
Output format :
``````For each test case, print a single line containing an integer that represents the Modified Integer.

Output for each test case will be printed in a separate line.
``````
Note
``````You are not required to print the output, it has already been taken care of. Just implement the function.
``````
Constraints:
``````1 <= 'T' <= 10
1 <= 'NUM' <= 10^9
1 <= 'N' <= 10^5
1 <= 'ARR[i]' <= 31

Time Limit: 1 sec
``````
##### Sample Input 1:
``````2
21
3
4 2 1
40
1
4
``````
##### Sample Output 1:
``````30
32
``````
##### Explanation for Sample Input 1:
``````Before flipping
21 => 10101
After flipping the 4th, 2nd and 1st bit from the end we get
30 => 11110

Before flipping
40 => 101000
After flipping the 4th bit from the end we get
32 => 100000
``````
##### Sample Input 2:
``````1
5
3
6 2 5
``````
##### Sample Output 2:
``````55
``````
Console