cf 742B Arpa's......

B. Arpa’s obvious problem and Mehrdad’s terrible solution

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 ≤ 105, 0 ≤ x ≤ 105) — the number of elements in the array and the integer x.

Second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 105) — the elements of the array.

Output

Print a single integer: the answer to the problem.

Examples

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.

咋说呢，确实是水题一道，但是涉及的基础重要知识点还是蛮多的，异或运算，map模板，桶排序（哈希表）

首先讲一下

异或运算：

1.0^任何数等于这个数本身

2.异或满足交换律：a^b^c=a^c^b。掌握常见模型：a^b=c,b=a^c

3.异或具体位运算的时候，只有和为1时结果会是1

接着说这道题，如果这道题像选择排序那样会超时，所以只能一边循环，用桶排序的方式，核心思想是找a[i]^a[j]==x这里就是先算cnt=x^a[i]然后看cnt为值得数有几个（默认是0个就不加咯）

#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<map>
using namespace std;
#define maxn 100005
long long sz[maxn];
int main()
{
	long long n,x;
	long long key,cnt;
	while(scanf("%I64d %I64d",&n,&x)==2)
	{
		key=0;
		cnt=0;
		map<long long,long long> mm;//mm用来记录不同的数值有几个
		for(int i=0;i<n;i++)
		{
			scanf("%I64d",&sz[i]);
			mm[sz[i]]++;
		}
		for(int i=0;i<n;i++)
		{
			cnt=x^sz[i];
			if(cnt==sz[i])
				key+=mm[cnt]-1;
			else
				key+=mm[cnt];
		}
		cout<<key/2<<endl;//因为在寻找符合条件的对数时往回找了，所以要除以2
	}
	return 0;
}