Arpa’s obvious problem and Mehrdad’s terrible solution

xor（异或）满足 a xor b = c ；b xor c = a 的性质

wa原因：

x=0这组样例

>,<运算符是优先与^的

题解：

点击打开链接http://blog.csdn.net/cillyb/article/details/53495330
点击打开链接http://blog.csdn.net/gengman/article/details/53501454

There are some beautiful girls in Arpa’s 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, j (1 ≤ i < j ≤ n) such that , where  is bitwise xoroperation (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.

Input

First line contains two integers n and x (1 ≤ n ≤ 10⁵, 0 ≤ x ≤ 10⁵) — the number of elements in the array and the integer x.

Second line contains n integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁵) — the elements of the array.

Output

Print a single integer: the answer to the problem.

Example

Input

2 3
1 2

Output

1

Input

6 1
5 1 2 3 4 1

Output

2

Note

In the first sample there is only one pair of i = 1 and j = 2.  so the answer is 1.

In the second sample the only two pairs are i = 3, j = 4 (since ) and i = 1, j = 5 (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.

#include<stdio.h>
#include<map>
using namespace std;
int main()
{
	int n,x,num[100005]={0};
	long long cnt=0;
	map<int,int> mp;
	scanf("%d%d",&n,&x);
	for(int i=0;i<n;i++)
	{
		scanf("%d",&num[i]);
		mp[num[i]]++;		
	}
	if(x)
	{
		for(int i=0;i<n;i++)
		{
			if(mp[num[i]^x])
			{
				cnt+=mp[num[i]^x];
				mp[num[i]]--;
			}			
		}
	}
	else
	{
		for(int i=0;i<n;i++)
		{
			if(mp[num[i]])
			{
				cnt+=mp[num[i]]-1;
				mp[num[i]]--;
			}			
		}
	}		
	printf("%lld",cnt);
	return 0;
}