#include <bits/stdc++.h>
using namespace std;
long long a[10005], x = 0;
int k;
void dq(int n, int s)
{
	if (k == 0) return;
	if (s == 0)
	{
		k--;
		for (int i = 1; i <= x; i++)
		{
			cout << a[i] << " ";
		}
		cout << 0 << endl;
		return;
	}
	if (n < 1) return;
	if (n <= s)
	{
		x++;
		a[x] = n;
		dq(n - 1, s - n);
		x--;
	}
	dq(n - 1, s);
}
int main()
{
	int n, s; cin >> n >> k >> s;
	dq(n, s);
}