//qoj5349
#include <bits/stdc++.h>
using namespace std;

const int T = 1e7;
int p[20000005];
int seed, n, k, S;
int pr[20000005];
int buc[20000005];

void solve(){
    int le = 0, nw = 0;
    int ans0, ansS, ansB;
    p[0] = p[n];
    for(int i = 1; i <= n; ++ i){
        pr[i] = pr[i-1] + (p[i] == 1 ? 1 : -1);
        if(p[i] == 1){
            ++ buc[T+pr[i]];
            if(pr[i] > 0){
                ++ le;
            }
        }
    }
    for(int i = 1; i <= n; ++ i){
        if(p[i-1] == 0){
            if(le == 0){
                ans0 = i;
            }
            if(le == S){
                ansS = i;
            }
            if(le == k - S){
                ansB = i;
            }
        }
        if(p[i] == 0){
            le += buc[T+nw];
            -- nw;
        } else {
            ++ nw;
            le -= buc[T+nw];
            -- buc[T+pr[i]];
            if(pr[i]+nw > 0) -- le;
            -- pr[i];
            ++ buc[T+pr[i]];
            if(pr[i]+nw > 0) ++ le;
        }
    }
    -- ans0;
    if(!ans0){
        ans0 = n;
    }
    -- ansS;
    if(!ansS){
        ansS = n;
    }
    -- ansB;
    if(!ansB){
        ansB = n;
    }
    printf("%d\n%d\n%d\n", ans0, ansS, ansB);
}

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 main() {
	generateData();
    solve();
	return 0;
}