#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);
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmxvbmcgbG9uZyBhWzEwMDA1XSwgeCA9IDA7CmludCBrOwp2b2lkIGRxKGludCBuLCBpbnQgcykKewoJaWYgKGsgPT0gMCkgcmV0dXJuOwoJaWYgKHMgPT0gMCkKCXsKCQlrLS07CgkJZm9yIChpbnQgaSA9IDE7IGkgPD0geDsgaSsrKQoJCXsKCQkJY291dCA8PCBhW2ldIDw8ICIgIjsKCQl9CgkJY291dCA8PCAwIDw8IGVuZGw7CgkJcmV0dXJuOwoJfQoJaWYgKG4gPCAxKSByZXR1cm47CglpZiAobiA8PSBzKQoJewoJCXgrKzsKCQlhW3hdID0gbjsKCQlkcShuIC0gMSwgcyAtIG4pOwoJCXgtLTsKCX0KCWRxKG4gLSAxLCBzKTsKfQppbnQgbWFpbigpCnsKCWludCBuLCBzOyBjaW4gPj4gbiA+PiBrID4+IHM7CglkcShuLCBzKTsKfQo=