#include <cstdio>
#include <algorithm>
using namespace std;

const char FIN[] = "combinari.in";
const char FOU[] = "combinari.out";

int V[20];
int N, K;

int main ()
{
    freopen(FIN, "r", stdin);
    freopen(FOU, "w", stdout);

    scanf("%d %d", &N, &K);

    fill_n ( V, N + 1, 1);

    fill_n ( V, K + 1, 0);

    do
    {
        for (int i = 1; i <= N; ++i)
            if ( V[i] == 0 )
                printf ("%d ", i);
        printf ("\n");
    }
    while (next_permutation (V + 1, V + N + 1));




    return 0;
}