Nil Xor

Chef has two non negative integers $N$ and $X$. He now wants to find the number of integers $K$ such that $0 \le K \lt N$, and $(N \oplus K) \And X = 0$. Note that $\oplus$ denotes the bitwise XOR operator and $\And$ denotes the bitwise AND operator. Help Chef in finding the total required count. ### Input - The first line of input will contain a single integer $T$, denoting the number of test