Codeforce 741B （XOR运算）

题意：

给出n个数，问有多少组Ai XOR Aj = k，i<j

思路：

若a^b=c那么a^c=b

代码：

#include <bits/stdc++.h>

using namespace std;
const int MAXN=1e5+10;
int main()
{
    long long n,k,cut[MAXN],a[MAXN];
    while(~scanf("%lld%lld",&n,&k)){
        memset(cut,0,sizeof(cut));
        long long ans=0;
        for(int i=0;i<n;i++){
            scanf("%lld",&a[i]);
            long long temp=k^a[i];
            if(temp<MAXN)
            ans+=cut[temp];
            cut[a[i]]++;
        }
        cout<<ans<<endl;
    }
}

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 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.

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.