// Skyqwq
#include <bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;

template <typename T> bool chkMax(T &x, T y) { return (y > x) ? x = y, 1 : 0; }
template <typename T> bool chkMin(T &x, T y) { return (y < x) ? x = y, 1 : 0; }

template <typename T> void inline read(T &x) {
    int f = 1; x = 0; char s = getchar();
    while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
    while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
    x *= f;
}

const int N = 2e7 + 5, M = 1e7 + 2;

int p[20000005], a[N], s[N];
int seed, n, k, S;
int getrand()
{
	seed = ((seed * 12321) ^ 9999) % 32768;
	return seed;
}
void generateData()
{
	scanf("%d%d%d",&k,&seed,&S);
	int t = 0;
	n = k * 2 + 1;
	memset(p, 0, sizeof(p));
	for (int i = 1; i <= n; i++)
	{
		p[i] = (getrand() / 128) % 2;
		t += p[i];
	}
	int i = 1;
	while (t > k)
	{
		while (p[i] == 0)
			i++;
		p[i] = 0;
		t--;
	}
	while (t < k)
	{
		while (p[i] == 1)
			i++;
		p[i] = 1;
		t++;
	}
}

int ans[4];

void inline work12() {
	for (int i = 1; i <= n; i++) {
		int v = p[i] ? 1 : -1;
		a[i] = v + a[i - 1];
		if (p[i]) s[a[i] + M]++;
	}
	for (int i = N - 2; i >= 0; i--)
		s[i] += s[i + 1];
	for (int i = 1; i <= n; i++) {
		if (p[i]) {
			s[a[i] + M]--;
			a[i]--;
			continue;
		}
		int o = s[a[i] + 1 + M];
		if (o == 0) ans[1] = i;
		if (o == S) ans[2] = i;
	}
}

void inline work3() {
	memset(s, 0, sizeof s);
	for (int i = 1; i <= n; i++) {
		int v = p[i] ? -1 : 1;
		a[i] = v + a[i - 1];
		if (!p[i]) s[a[i] + M]++;
	}
	for (int i = N - 2; i >= 0; i--)
		s[i] += s[i + 1];
	for (int i = 1; i <= n; i++) {
		if (!p[i]) {
			int o = s[a[i] + 1 + M];
			if (o == S) ans[3] = i;	
		}
		if (!p[i]) {
			a[i]++;
			s[a[i] + M]++;
		}	
	}
}

int main()
{	
	generateData();
	work12();
	work3();
	printf("%d\n%d\n%d\n", ans[1], ans[2], ans[3]);
	return 0;
}