#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
const int N = 4e6 + 6;
typedef long long ll;
ll a[N];
int head[N], nxt[N], to[N], num = 1;
void add(int u, int v) {
    num++;
    to[num] = v;
    nxt[num] = head[u];
    head[u] = num;
}

int sz[N], dep[N], fa[N], son[N], top[N], id[N], rnk[N], tot = 0;
void dfs1(int u) {
    sz[u] = 1;
    for (int i = head[u]; i; i = nxt[i]) {
        int v = to[i];
        dep[v] = dep[u] + 1;
        fa[v] = u;
        dfs1(v);
        sz[u] += sz[v];
        if (sz[v] > sz[son[u]]) {
            son[u] = v;
        }
    }
}
void dfs2(int u, int ance) {
    top[u] = ance;
    id[u] = ++tot;
    rnk[tot] = u;
    if (!son[u]) return;
    dfs2(son[u], ance);
    for (int i = head[u]; i; i = nxt[i]) {
        int v = to[i];
        if (v != son[u]) {
            dfs2(v, v);
        }
    }
}

#define lc (u * 2)
#define rc (u * 2 + 1)
#define mid ((l + r) / 2)
ll tr[N * 4], lazy[N * 4];
void build(int u, int l, int r) {
    if (l == r) {
        tr[u] = a[rnk[l]];
        return;
    }
    build(lc, l, mid);
    build(rc, mid + 1, r);
    tr[u] = tr[lc] + tr[rc];
}
void lz(int u, int l, int r, ll k) {
    lazy[u] = k;
    tr[u] = k * (r - l + 1);
}
void pd(int u, int l, int r) {
    if (lazy[u] == -1) return;
    lz(lc, l, mid, lazy[u]);
    lz(rc, mid + 1, r, lazy[u]);
    lazy[u] = -1;
}
ll query(int u, int l, int r, int x, int y) {
    if (y < l || x > r) return 0;
    if (x <= l && r <= y) {
        return tr[u];
    }
    pd(u, l, r);
    return query(lc, l, mid, x, y) + query(rc, mid + 1, r, x, y);
}
void change(int u, int l, int r, int x, int y, ll k) {
    if (x <= l && r <= y) {
        lz(u, l, r, k);
        return;
    }
    pd(u, l, r);
    if (x <= mid) change(lc, l, mid, x, y, k);
    if (mid < y) change(rc, mid + 1, r, x, y, k);
    tr[u] = tr[lc] + tr[rc];
}
int n, k, sed;
void cg(int x, int y, int z) {
    while (top[x] != top[y]) {
        if (dep[top[x]] < dep[top[y]]) {
            swap(x, y);
        }
        change(1, 1, n, id[top[x]], id[x], z);
        x = fa[top[x]];
    }
    if (dep[x] > dep[y]) {
        swap(x, y);
    }
    change(1, 1, n, id[x], id[y], z);
}
ll ask(int x, int y) {
    ll ans = 0;
    while (top[x] != top[y]) {
        if (dep[top[x]] < dep[top[y]]) {
            swap(x, y);
        }
        ans = ans + query(1, 1, n, id[top[x]], id[x]);
        x = fa[top[x]];
    }
    if (dep[x] > dep[y]) {
        swap(x, y);
    }
    ans = ans + query(1, 1, n, id[x], id[y]);
    return ans;
}
bool b[N];
vector<int> v;

// ll sum[N];
// void dfs(int x, ll y) {
//     y += a[x];
//     sum[x] = y;
//     for (int i = head[x]; i; i = nxt[i]) {
//         int v = to[i];
//         dfs(v, y);
//     }
// }
int main() {
    freopen("x.in", "r", stdin);
    freopen("x.out", "w", stdout);
    cin >> n >> k >> sed;
    a[1] = sed;
    for (int i = 2; i <= n; i++) {
        a[i] = (a[i - 1] * 23333333 + 6666666) % 1000000007;
        int f = (a[i] ^ 23333333) % (i - 1) + 1;
        add(f, i);
        b[f] = 1;
    }
    for (int i = 1; i <= n; i++) {
        if (!b[i]) v.push_back(i);
    }
    dfs1(1);
    dfs2(1, 1);
    ll ans = 0;
    // while (k--) {
    //     ll len = v.size(), id = 0, mx = -1;
    //     dfs(1, 0);
    //     for (int i = 0; i <= len - 1; i++) {
    //         if (sum[v[i]] > mx) {
    //             id = v[i];
    //             mx = sum[v[i]];
    //         }
    //     }
    //     ans += mx;
    //     while (id) {
    //         a[id] = 0;
    //         id = fa[id];
    //     }
    // }
    // cout << ans;

    // return 0;
    memset(lazy, -1, sizeof(lazy));
    build(1, 1, n);
    while (k--) {
        ll len = v.size(), id = 0, mx = -1;
        for (int i = 0; i <= len - 1; i++) {
            ll cnt = ask(1, v[i]);
            if (cnt > mx) {
                id = v[i];
                mx = cnt;
            }
        }
        ans += mx;
        cg(1, id, 0);
    }
    cout << ans;
    return 0;
}