#include <iostream>
#include <stdio.h>
using namespace std;

int g_seed;

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

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

int n, A;
const int LIM = 10000;
const int PULL = 9000;
int B[11111];
int offset = 0;

int m3[111], m5[111];

unsigned long long multiplier = 1ULL;
const unsigned long long mc = 139ULL;

unsigned long long ans = 0ULL;

void relocate()
{
    int i,j;

    for (i=0;i<PULL;i++)
    {
        for (j=1;j<=B[i];j++)
        {
            ans += multiplier * (unsigned long long)(i + offset);
            multiplier *= mc;
        }
        B[i] = 0;
    }

    for (i=PULL;i<=LIM;i++)
    {
        B[i-PULL] = B[i];
        B[i] = 0;
    }

    A -= PULL;
    offset += PULL;
}

int main()
{
    freopen("justsort.in", "r", stdin);
    freopen("justsort.out", "w", stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int mod3, mod5;
    int i,j;

    for (i=0;i<100;i++)
    {
        m3[i] = i % 3;
        m5[i] = i % 5;
    }

    cin>>n>>A>>g_seed;

    mod3 = A % 3;
    mod5 = A % 5;

    if (A > 10)
    {
        offset = A - 10;
        A = 10;
    }

    B[A - mod3 * mod5]++;
    for (i=1;i<n;i++)
    {
        int inc = nextinc();

        A += inc;
        mod3 = m3[mod3+inc];
        mod5 = m5[mod5+inc];

        if (A > LIM)
            relocate();

        //cout<<A+offset<<endl;
        B[A - mod3*mod5]++;
    }

    for (i=0;i<=LIM;i++)
    {
        for (j=1;j<=B[i];j++)
        {
            //cout<<"swallow "<<i+offset<<endl;
            ans += multiplier * (unsigned long long)(i + offset);
            multiplier *= mc;
        }
    }

    cout<<ans<<endl;

    return 0;
}