#include<bits/stdc++.h>
#include<iostream>
#include<cmath>
#include<vector>
#include<string>
#include<queue>
#include<set>
#include<map>
#include<algorithm>
#include<functional>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll, int> plli;
typedef pair<int, pii> pipii;
typedef vector<vector<int> > mati;
typedef vector<vector<double> > matd;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;

#define FOR(i,x,y) for(ll i=(ll)x; i<(ll)y; ++i)
#define REP(i,y) FOR(i, 0, y)
#define RFOR(i,x,y) for(ll i=(ll)x; i>=(ll)y; --i)
#define RREP(i,x) RFOR(i, x, 0)

template <typename T>
void vec_print(vector<T> VEC){
  REP(i, VEC.size()){
    cout << VEC[i] << " ";
  }
  cout << "\n";
};

template <typename T>
void mat_print(vector<vector<T> > MAT){
  REP(i, MAT.size()){
    REP(j, MAT[i].size()){
      cout << MAT[i][j] << " ";
    }
    cout << "\n";
  }
};

template <typename CLASS1, typename CLASS2>
class HOGE{
  public:
    CLASS1 key;
    CLASS2 value;
    HOGE(void){
      return;
    };
    HOGE(CLASS1 key, CLASS2 value){
      this->key = key;
      this->value = value;
    };
    ~HOGE(void){
      return;
    };

    void print(void){
      cout << "key : " << key << ", value : " << value << "\n";
      return;
    };
    
    bool operator==(const HOGE &obj){
      return (this->value == obj.value);
    };
    bool operator<(const HOGE &obj){
      return (this->value < obj.value);
    };
    bool operator>(const HOGE &obj){
      return (this->value > obj.value);
    };
};

constexpr int INF = (1<<30);
constexpr ll INFLL = 1LL<<62;
constexpr long double EPS = 1e-12;
constexpr ll MOD = (ll)((1E+9)+7);

ll N, K;
vll A, B;

ll search(void){
  ll K_copy = K;
  ll A_max = 1;
  while(K_copy>0){
    K_copy>>=1;
    A_max<<=1;
  }
  A_max>>=1;
  //vb usable(N, true);
  REP(i, A.size()){
    if(A[i]>K){
      //usable[i] = false;
      swap(A[i], A[A.size()-1]);
      A.pop_back();
      swap(B[i], B[B.size()-1]);
      B.pop_back();
      --i;
    }
  }
  ll ans = 0;
  while(A_max>0){
    if((A_max&K)==0){
      REP(i, A.size()){
        if((A_max&A[i])!=0){
          //usable[i] = false;
          swap(A[i], A[A.size()-1]);
          A.pop_back();
          swap(B[i], B[B.size()-1]);
          B.pop_back();
          --i;
        }
      }
    }else{
      ll ans_tmp = 0;
      REP(i, A.size()){
        //if(!usable[i]) continue;
        if((A_max&A[i])==0){
          ans_tmp += B[i];
        }
      }
      ans = max(ans, ans_tmp);
    }
    A_max>>=1;
  }
  ll ans_tmp = 0;
  REP(i, A.size()){
    //if(!usable[i]) continue;
    ans_tmp += B[i];
  }
  ans = max(ans, ans_tmp);
  return ans;
}

int main(){
  cin.tie(0); // cut the cin and cout (default, std::flush is performed after std::cin)
  ios::sync_with_stdio(false); // cut the iostream and stdio (DON'T endl; BUT "\n";)

  cin >> N >> K;
  A.resize(N);
  B.resize(N);
  REP(i, N) cin >> A[i] >> B[i];

  cout << search() << "\n";

  return 0;
}

Measured memory_bytes: 1792