#include <stdio.h>

int main()
{
	int N;
	long long M, K;
	scanf("%d %lld %lld", &N, &M, &K);
	
	int i, j, ans[100001];
	long long k;
	for (i = 1, k = 0; k < K; i++) k += i;
	for (j = 0; j < i; j++) ans[j] = i - j - 1;
	for (j = i - 1; k > K; j--, k--) {
		ans[j] ^= ans[j-1];
		ans[j-1] ^= ans[j];
		ans[j] ^= ans[j-1];
	}
	for (j = i; j < N; j++) ans[j] = j;
	for (i = 0; i < N; i++) {
		if (ans[i] < N - 1) printf("%d\n", ans[i]);
		else printf("%lld\n", ans[i] + M - (long long)N * (N - 1) / 2);
	}
	fflush(stdout);
	return 0;
}