B'There are some beautiful girls in Arpa xe2 x80 x99s land as mentioned before. Once Arpa came up with an obvious problem: Given an array and a number x, count the number of pairs of indices i, xe2 x80 x89j (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89i xe2 x80 x89< xe2 x80 x89j xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n) such that , where is bitwise xor operation (see notes for explanation). Immediately, Mehrdad discovered a terrible solution that nobody trusted. Now Arpa needs your help to implement the solution to that problem. First line contains two integers n and x (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105, xe2 x80 x890 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89x xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105) -- the number of elements in the array and the integer x. Second line contains n integers a1, xe2 x80 x89a2, xe2 x80 x89..., xe2 x80 x89an (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89ai xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105) -- the elements of the array. Print a single integer: the answer to the problem. In the first sample there is only one pair of i xe2 x80 x89= xe2 x80 x891 and j xe2 x80 x89= xe2 x80 x892. so the answer is 1. In the second sample the only two pairs are i xe2 x80 x89= xe2 x80 x893, j xe2 x80 x89= xe2 x80 x894 (since ) and i xe2 x80 x89= xe2 x80 x891, j xe2 x80 x89= xe2 x80 x895 (since ). A bitwise xor takes two bit integers of equal length and performs the logical xor operation on each pair of corresponding bits. The result in each position is 1 if only the first bit is 1 or only the second bit is 1, but will be 0 if both are 0 or both are 1. You can read more about bitwise xor operation here: https://en.wikipedia.org/wiki/Bitwise_operation#XOR. '...