#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;
using T = tuple<int, int, bool>;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, t; cin >> n >> t;
    vector<int> a(n);
    for(int i = 0; i < n; i++) cin >> a[i];
    ll ans = 0;
    vector<vector<int>> r(n, vector<int>(30, -1));
    for(int i = 0; i < 30; i++){
        int f = t&(1<<i);
        int l = -1;
        for(int j = 0; j < n; j++){
            int g = a[j]&(1<<i);
            if(f != g){
                if(l != -1) r[l][i] = j-1;
                l = j;
                f = g;
            }
        }
        if(l != -1) r[l][i] = n-1;
    }
    // for(int i = 0; i < n; i++) {
    //     cout << i << ' ';
    //     for(int j = 0; j < 30; j++){
    //         if(r[i][j] != -1) cout << j << ':' << r[i][j] << ' ';
    //     }
    //     cout << endl;
    // }
    priority_queue<T, vector<T>, greater<T>> que;
    int cur = t;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < 30; j++){
            if(r[i][j] != -1) {
                bool ope_and = (a[i]&(1<<j)) == 0;
                que.push(T(r[i][j], -j, ope_and));
            }
        }
        while(!que.empty()){
            auto [r, j, ope_and] = que.top(); que.pop();
            if(r < i) continue;
            j = -j;
            int nx = ope_and ? (cur&a[r]) : (cur|a[r]);
            if(cur != nx){
                ans += abs(nx-cur);
                cur = nx;
                break;
            }
        }
    }
    cout << ans << endl;
}