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 <image>, where <image> is bitwise xor operation (see notes for explanation).

<image>

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. <image> so the answer is 1.

In the second sample the only two pairs are i = 3, j = 4 (since <image>) and i = 1, j = 5 (since <image>).

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>.
//package com.company;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class Main {

    public static void main(String[] args) throws IOException {
        // write your code here
       Scanner s = new Scanner(System.in);
         // BufferedReader s=new BufferedReader(new InputStreamReader(System.in));
        StringBuilder sb = new StringBuilder();
       int n=s.nextInt();long x=s.nextLong();
       long[] a=new long[n];HashMap<Long,Long> h=new HashMap<Long, Long>();
       for(int i=0;i<n;i++){
           a[i]=s.nextLong();
          if(h.containsKey(a[i])){
              h.put(a[i],h.get(a[i])+1);
          }else{
              h.put(a[i],1L);
          }
       }Arrays.sort(a);
     if(x!=0){long ans=0;
           for(int i=0;i<n;i++){
               if(h.containsKey(a[i]^x)&&(a[i]^x)>a[i]){
                   ans+=h.get(a[i])*h.get(a[i]^x);
                   i+=h.get(a[i])-1;
               }
           }
         System.out.println(ans);
     }else{
           long ans=0;
           for(int i=0;i<n;i++){
               if(h.get(a[i])>1){
                   ans+=(h.get(a[i])*(h.get(a[i])-1))/2;i+=h.get(a[i])-1;
               }
           }
         System.out.println(ans);
     }


    }



    static double power(double x, long y, int p)
    {
        double res = 1;
 x = x % p;
        while (y > 0)
        {
            if((y & 1)==1)
                res = (res * x) % p;
            y = y >> 1;
            x = (x * x) % p;
        }
        return res;
    }
    static int m;
    static int n;
    static int path = Integer.MAX_VALUE;
    static int got = 0;
static Long[] sum;static Long[] a;
    public static long dfs(int i, ArrayList<Integer>[] h, int[] vis) {
        vis[i] = 1;
        sum[i]+=a[i];if(h[i]==null) return sum[i];
        for (Integer j : h[i]) {
            if (vis[j] == 0) {
                sum[i]+=dfs(j, h, vis);
            }
        }return sum[i];
    }static long max=Long.MIN_VALUE;static long max1=Long.MIN_VALUE;
    public static void dfs1(int i, ArrayList<Integer>[] h, int[] vis) {
        vis[i] = 1;//sum[i]+=a[i];
        if(h[i]==null) return ;
        for (Integer j : h[i]) {
            if (vis[ j] == 0) {
                if(sum[j]>max) {max1=max;max=sum[j];}
                else if(sum[j]>max1) max1=sum[j];
                dfs1(j, h, vis);
            }
        }return ;
    }static long fans=Long.MIN_VALUE;
    public static long dfs2(int i, ArrayList<Integer>[] h, int[] vis) {
        long max2=Long.MIN_VALUE;long max3=Long.MIN_VALUE;
        vis[i] = 1;if(h[i]==null) return a[i];
        for (Integer j : h[i]) {
            if (vis[ j] == 0) {
              long k=  dfs2(j, h, vis);
              if(k>max2) { max3=max2;max2=k;}
              else if(k>max3) max3=k;
            }
        }
     //   System.out.println(i+" "+max2+" "+max3+" "+sum[i]);
        if(max2!=Long.MIN_VALUE&&max3!=Long.MIN_VALUE&&max2+max3> fans) fans=max2+max3;
     //   if(i==1) return max2;
        return Math.max(sum[i],max2);
    }

    public static void bfs(int i, HashMap<Integer, Integer>[] h, int[] vis, int len, int papa) {
        Queue<Integer> q = new LinkedList<Integer>();
        q.add(i);

    }


    static int i(String a){
        return Integer.parseInt(a);
    }static long l(String a){
        return Long.parseLong(a);
    }static String[] inp() throws IOException{
        BufferedReader s=new BufferedReader(new InputStreamReader(System.in));
        return s.readLine().trim().split("\\s+");
    }
}

class Student
{
 int t,l,r;
//    String name, address;

    // Constructor
    public Student(int t,int r)
    {this.t=t;

        this.r=r;
    }

    // Used to print student details in main()
    public String toString()
    {
        return this.t + " " +this.l+" "+this.r;
    }
}

class Sortbyroll implements Comparator<Student>
{
    // Used for sorting in ascending order of
    // roll number
    public int compare(Student a, Student b)
    {
        return a.t-b.t;
    }
}