Bit Manipulation

An array is given of n positive elements where each element can be represented in 64 bits. There will be two types of queries $q$, one type of query will be represented by $1k$, and the other type of query will be represented by $2m$. In the first query, $k$ is the position at which one needs to flip the bit(0 to 1 or 1 to 0) in all the elements in the array. In the second query, them is the nu