Beautiful Subarrays

E. Beautiful Subarrays

One day, ZS the Coder wrote down an array of integers a with elements a₁,  a₂,  ...,  a_n.

A subarray of the array a is a sequence a_l,  a_{l  +  1},  ...,  a_r for some integers (l,  r) such that 1  ≤  l  ≤  r  ≤  n. ZS the Coder thinks that a subarray of a is beautiful if the bitwise xor of all the elements in the subarray is at least k.

Help ZS the Coder find the number of beautiful subarrays of a!

Input

The first line contains two integers n and k (1 ≤ n ≤ 10⁶, 1 ≤ k ≤ 10⁹) — the number of elements in the array a and the value of the parameter k.

The second line contains n integers a_i (0 ≤ a_i ≤ 10⁹) — the elements of the array a.

Output

Print the only integer c — the number of beautiful subarrays of the array a.

Examples

Input

3 1
1 2 3

Output

5

Input

3 2
1 2 3

Output

3

Input

3 3
1 2 3

Output

2

题意：题目的意思是给你ｎ个非负整数的数组．求这个数组中有多少个子区间，区间的异或和至少是ｋ

题解：看到异或和，就联想到了字典树了．．．blabla　枚举数组，对于第ｉ个数，求出有多少个以第ｉ个数为结尾的区间满足区间异或和至少是ｋ．很自然，对于一个数，如何判断

它是否大于等于ｋ，这个可以通过比较他们的二进制位．因为整数最大为1e9，所以最多比较31次．接下来就分类讨论下：　对于第ｊ个二进制位，如果ｋ＆ (1<<j) > 0，则要保证以

第ｉ个数结尾的区间异或和在第ｊ个二进制位也要为１．反过来为０．知道这个后，就可以通过异或前缀和来找出有多少个区间满足这种情况．但是如果纯粹枚举时间复杂度是n^2 *

30的，所以可以通过一种数据结构字典树来优化复杂度，时间复杂度降为n * 30．这样题目就可以在１ｓ以内跑过去了，题目给了３ｓ，还是挺良心的．

AC代码：

#include <iostream>
#include <vector>
#include <map>
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;

typedef long long ll;
const int N = 3e7 + 5;
int tot;

struct Node
{
    int val;
    int next[2];
    void init()
    {
        val = 0;
        memset(next,0,sizeof next);
    }
}tree[N];

void Insert(int x)
{
    int pos = 0;
    for(int i = 30; i >= 0; --i)
    {
        int v = (x & (1 << i)) ? 1 : 0;
        if(!tree[pos].next[v])
        {
            tree[++tot].init();
            tree[pos].next[v] = tot;
        }
        pos = tree[pos].next[v];
        ++tree[pos].val;
    }
}

int Find(int x,int k)
{
    int cnt,pos;
    cnt = pos = 0;
    for(int i = 30; i >= 0; --i)
    {
        int v = (x & (1 << i)) ? 1 : 0;
        if(k & (1 << i))
        {
            pos = tree[pos].next[v ^ 1];
        }
        else
        {
            int tp = tree[pos].next[v ^ 1];
            pos = tree[pos].next[v];
            cnt += tree[tp].val;
        }
        if(pos == 0)
            break;
        if(i == 0)
            cnt += tree[pos].val;
    }
    return cnt;
}

void solve()
{
    int n,k,temp,x;
    ll ans = 0;
    scanf("%d %d",&n,&k);
    tot = temp = 0;
    tree[tot].init();
    for(int i = 1; i <= n; ++i)
    {
        scanf("%d",&x);
        Insert(temp);
        temp ^= x;
        ans += Find(temp,k);
    }
    cout << ans << endl;
}


int main()
{
    solve();
    return 0;
}