#include <fstream>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <string.h>
#include <queue>
#include <math.h>
#include <set>
#include <stack>

#define min(a,b) ((a<b)?a:b)
#define max(a,b) ((a<b)?b:a)
#define abs(a) ((a<0)?-a:a)
#define REP(i,a,b) \
	for (int i=a; i<=b; i++)

#define INF 1000000000

using namespace std;

//#define TEST
#ifdef TEST
ifstream fin("input.txt");
ofstream fout("output.txt");
#else
ifstream fin("combinari.in");
ofstream fout("combinari.out");
#endif // TEST

#define MAXN 2000000001
#define pb push_back
#define mp make_pair
#define MOD 1000000007

typedef long long ll;
typedef pair<int,int> pp;

int n,k;

int a[18];

void bt(int m, int l)
{
    a[l] = m;
    if (l==k-1)
    {
        for (int i=0; i<k; i++)
            fout<<a[i]<<' ';
        fout<<'\n';
    } else
    for (int i=m+1; i<=n; i++)
        bt(i,l+1);
}

int main()
{
    fin>>n>>k;
    for (int i=1; i+k-1<=n; i++)
        bt(i,0);

	return 0;
}