#include<bits/stdc++.h>

using namespace std;

const int maxi = 500;
#define pb push_back
int n;
int a[20];
deque<int> v;
int g_seed;
unsigned long long rez = 1;

unsigned int fastrand()
{
    g_seed = 214013*g_seed + 2531011;

    return (g_seed>>16) & 0x7FFF;
}

int next(int pre)
{
    return 1 + pre + (fastrand() & 0b111);
}
void read_data()
{
   freopen("justsort.in", "r", stdin);

   cin>>n>>a[0]>>g_seed;

   v.pb(a[0]-(a[0]%3)*(a[0]%5));
   int last =  0;
   unsigned long long st = 1;
    rez = 0;
   int pre = a[0];
   for (int i = 1;i<n;i++){
     int val = next(pre);

     pre = val;
     val-= (val%3) *(val%5);

     v.pb(val);
     last++;

     int idx = last;
     while(idx > 0 && v[idx] < v[idx-1]){
        swap(v[idx], v[idx-1]);
        idx--;
     }

     if (v.size()>5){
        rez+=v[0]*st;
        st*=139;
        v.pop_front();
        last--;
     }
   }

   for (int i:v){
    rez+=i*st;
    st*=139;
   }

   fclose(stdin);
}

void print_data()
{
     freopen("justsort.out", "w",stdout);
      cout<<rez<<endl;
    fclose(stdout);
}

int main()
{
    read_data();

    print_data();
}