#include <cstdio>

using namespace std;

int x[10];
int n, l;

void back (int k) {
    if (k == l) {
        for (int i=1; i<=l; ++i)
            printf ("%d ", x[i]);
        printf ("\n");
    } else {
        for (int i=x[k]+1; i<=n; ++i) {
            x[k+1] = i;
            back (k+1);
        }
    }
}

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

    scanf ("%d %d", &n, &l);

    back (0);

    return 0;
}