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.

 

 

题意：

找出给定数列里两两异或值为x的组合个数

 

a^b=x; x^a=b; x^b=a;

x已经给定 我们只需循环a找是否有b与之对应。

 

附AC代码：

#include<bits/stdc++.h> 
using namespace std;
int a[100010];
int main(){
    map<int ,int > m;
    int n,x;
    cin>>n>>x;
    for(int i=1;i<=n;i++){
        scanf("%d",a+i);
    }
    long long ans=0;
    for(int i=1;i<=n;i++){
        if(m.count(x^a[i])) //找到返回1 否则返回0 
        ans+=m[x^a[i]];
        m[a[i]]++;
    }
    cout<<ans<<endl;
    return 0;
}