#include<iostream>
#include<fstream>

using namespace std;

int searchRange = 16;
const int inf = 1e9 + 22;

int n, a0, g_seed;

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

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

int arr[105];

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    ifstream cin("justsort.in");
    ofstream cout("justsort.out");

    unsigned long long ans = 0;
    unsigned long long p139 = 1;

    cin >> n >> a0 >> g_seed;
    searchRange = min(searchRange, n);

    for(int i = 0;i<searchRange;i++)
    {
        arr[i] = a0 -(a0%3)*(a0%5);
        a0 = next(a0);
    }

    for(int i = 0;i<n;i++)
    {
        int minInd = 0;
        for(int i = 0;i<searchRange;i++)
        {
            if(arr[i]<arr[minInd]) minInd = i;
        }

        ans = ans + p139*arr[minInd];
        p139 *= 139;

        if(i+1+searchRange>n)
        {
            arr[minInd] = inf;
        }
        else
        {
            arr[minInd] = a0 -(a0%3)*(a0%5);
            a0 = next(a0);
        }
    }

    cout << ans << '\n';
}