#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <string>
#include <map>
#include <stack>
#include <deque>
#include <unordered_set>
#include <unordered_map>
#include <set>
#define all(x) x.begin(), x.end()
#define trutruf first
#define rtururs second
#define pll pair <ll,ll>
#define pii pair <int,int>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

using namespace std;

long long n, k, p;
vector <vector <ll>> rez;

void cnt()
{
    int i = 0;
    while (i < k)
    {
        int j = 1;
        while (!(rez[i][j - 1] == 0 && rez[i][j] == 0) && j <= k + 1)
        {
            rez[i + 1][j] = rez[i][j - 1] + rez[i][j];
            j++;
        }
        i++;
    }
}

int main()
{
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    //cout << fixed << setprecision(20);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> k >> n >> p;
    rez.resize(k + 1);
    for (int i = 0; i < k + 1; i++)
    {
        rez[i].resize(k + 5);
        rez[i][0] = 0;
    }
    rez[0][1] = 1;
    cnt();
    for (int i = 0; i < k + 1; i++)
    {
        for (int ii = 0; ii < k + 1; ii++)
        {
            cout << rez[i][ii] << " ";
        }
        cout << "\n";
    }
    int last = 0;
    for (int i = 1; i <= n; i++)
    {
        for (int ii =last + 1; ii <= k; ii++)
        {
            if (p <= rez[k - ii + 1][n - i + 1])
            {
                cout << ii << " ";
                last = ii;
                break;
            }
            else
            {
                p -= rez[k - ii][n - i];
            }
        }
    }
    return 0;
}