# include <bits/stdc++.h>

using namespace std;

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

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

void backt(int k) {
    int i;
    if (k > m) afis(k);
    else{
        for (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 (int i = 1; i <= n; ++i)
        a[i] = i;

    backt (1);
}