#include<stdio.h>
int main()
{
	long long int n, m, k;
	scanf("%lld %lld %lld", &n, &m, &k);
	long long int i, j;
	long long int ans[100005];
	for (i = 0; i < n; i++)
		ans[i] = -1;
	for (i = 0, j = 0; i < n; i++)
	{
		if (k == 0)
		{
			while (ans[j] >= 0)
				j++;
			ans[j] = i;
		}
		else if (k >= n - i - 1)
		{
			k -= n - i - 1;
			ans[n - i - 1] = i;
		}
		else
		{
			ans[k] = i;
			k = 0;
		}
	}
	for (i = 0; i < n; i++)
		if (ans[i] == n - 1)
			j = i;
	ans[j] = m - (n - 2) * (n - 1) / 2;
	for (i = 0; i < n; i++)
		printf("%lld\n", ans[i]);
	return 0;
}