#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

ifstream fin("combinari.in");
ofstream fout("combinari.out");

void Back(int n, int k, int comb[], int i) {
    if (i == k + 1)
    {
        for (int i = 1; i <= k; i++)
            fout << comb[i] << " ";
        fout << "\n";
        return;
    }
    for (int v = 1; v <= n; v++)
    {
        bool valid = true;
        for (int j = 1; j < i; j++)
            if (comb[j] >= v)
                valid = false;
        if (valid == true)
        {
            comb[i] = v;
            Back(n, k, comb, i + 1);
        }
    }
}

int main()
{
    int n, k, comb[10];
    fin >> n >> k;
    Back(n, k, comb, 1);
    fin.close();
    fout.close();
    return 0;
}