#include <bits/stdc++.h>

using namespace std;

const int N = 2e7 + 5;

bitset<N> v;
int s[N], ct[N], vl[N];

signed main() {
    int n, sd, m; scanf("%d%d%d", &n, &sd, &m);
    auto rnd = [&] {
        sd = ((sd * 12321) ^ 9999) % 32768;
        return sd;
    };
    for (int i = 1; i <= n * 2 + 1; ++i) {
        v[i] = rnd() / 128 % 2;
    }
    int t = v.count();
    for (int i = 1; t > n; ++i) {
        if (v[i] == 1) v[i] = 0, --t;
    }
    for (int i = 1; t < n; ++i) {
        if (v[i] == 0) v[i] = 1, ++t;
    }
    for (int i = 1, z = n + 1; i <= n * 2 + 1; ++i) {
        z += (v[i] ? 1 : -1);
        if (v[i] == 1) ++s[z];
    }
    for (int i = n * 2; i; --i) s[i] += s[i + 1];
    for (int i = 1, z = n + 1; i <= n * 2 + 1; ++i) {
        z += (v[i] ? 1 : -1);
        if (v[i] == 1) ++ct[z];
        vl[i] = (v[i] ? -1 : s[z + 1] - ct[z + 1]);
    }
    printf("%ld\n", find(vl + 1, vl + n * 2 + 2, 0) - vl);
    printf("%ld\n", find(vl + 1, vl + n * 2 + 2, m) - vl);
    printf("%ld\n", find(vl + 1, vl + n * 2 + 2, n - m) - vl);
    return 0;
}