# include <bits/stdc++.h>

using namespace std;

const int Nmax = 20;

int n, m, i, sol[Nmax], a[Nmax];

void afis() {
    for (int i = 1; i <= m; ++i)
        printf("%d ", sol[a[i]]);
    printf("\n");
}

void backt(int k) {
    if (k > m) afis();
    else for (int i = sol[k - 1] + 1;  i <= n; ++i) {
            sol[k] = i;
            backt(k + 1);
    }
}

int main ()
{
    freopen("combinari.in", "r", stdin);
    freopen("combinari.out", "w", stdout);

    scanf("%d %d\n", &n, &m);

    for (i = 1; i <= n; ++i)
        a[i] = i;

    backt(1);

    return 0;
}