#include <bits/stdc++.h>
using namespace std;
int seed, n;
int rnd() { return seed = (seed * 19260817ll + 20230853) & INT_MAX; }
priority_queue<int, vector<int>, greater<int> > pq;
int main() {
  cin >> n >> seed;
  int ans = 0;
  for (int i = 1; i <= (n >> 1); ++i) pq.push(rnd());
  for (int i = 1; i <= (n >> 1); ++i) {
    switch (rnd() % 3) {
      case 0:
        pq.push(rnd());
        break;
      case 1:
        pq.pop();
        break;
      default:
        ans ^= pq.top();
    }
  }
  cout << ans << endl;
  return 0;
}