#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second
using namespace std;

unsigned ll n,a;
unsigned ll b;
unsigned ll res=0;
unsigned ll pov=1;
int g_seed;
multiset<int> pq;

unsigned int fastrand()
{
    g_seed = 214013*g_seed + 2531011;
    return (g_seed>>16) & 0x7FFF;
}

int next(int prev)
{
    return 1 + prev + (fastrand() & 0b111);
}


int main () {

    freopen("justsort.in","r",stdin);
    freopen("justsort.out","w",stdout);

    cin >> n >> a >> g_seed;
    return n;
    b = a - (a%3)*(a%5);
    pq.insert(b);
    for(int i=1;i<n;i++){
        a=next((unsigned int)a);
        b = a - (a%3)*(a%5);
        while(pq.size()>=900000){
            unsigned ll temp= *pq.begin();
            if(temp + 10>=b)
                break;
            pq.erase(pq.begin());
            res+=temp*pov;
            pov*=139ULL;
        }
        pq.insert(b);
    }

    for(auto i : pq){
        unsigned ll k = (unsigned ll)i;
        res+=k*pov;
        pov*=139ULL;
    }

    cout << res;

    return n;
}