#include <cstdio>
#include <vector>
#include <algorithm>
#include <ctime>

auto stClock = clock();

typedef long long ll;

const int MAXN = 4e6 + 10;
const ll MOD = 1e9 + 7;

int n, k, fa[MAXN];
std::vector<int> g[MAXN];
ll val[MAXN];
ll sum[MAXN];

int main() {
  #ifdef LOCAL
    freopen("!input.in", "r", stdin);
    freopen("!output.out", "w", stdout);
  #else
    freopen("x.in", "r", stdin);
    freopen("x.out", "w", stdout);
  #endif

  scanf("%d %d %lld", &n, &k, &val[1]);

  for (int i = 2; i <= n; ++i) {
    val[i] = (val[i - 1] * 23333333LL + 6666666LL) % MOD;
    fa[i] = (val[i] ^ 23333333LL) % (i - 1) + 1;
    g[fa[i]].push_back(i);
  }

  ll ans = 0;
  while (k--) {
    for (int i = 1; i <= n; ++i) sum[i] = sum[fa[i]] + val[i];
    int id = std::max_element(sum + 1, sum + n + 1) - sum;
    ans += sum[id];
    while (id) {
      val[id] = 0;
      id = fa[id];
    }

    auto edClock = clock();
    if (edClock - stClock >= 2.95 * CLOCKS_PER_SEC) break;
  }

  printf("%lld\n", ans);
  return 0;
}