#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<unordered_map>

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>

using namespace std;

const int nmax = 20;

int N, K, st[nmax];

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

    for(int i = 1; i <= N; i++)
        if(i > st[k - 1])
        {
            st[k] = i;
            back(k + 1);
        }
}

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

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

    back(1);

    return 0;
}