#include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
#define ll long long 
#define ull unsigned long long 
#define nmax 5000006
#define MOD 1999999973 
#define INF 2123456789
//#define fin cin 
//#define fout cout 

ifstream fin("combinari.in");
ofstream fout("combinari.out");

int m, n;
int sol[nmax];
int fr[nmax];

void Afis()
{
	for (int i = 1; i <= n; i++)
		fout << sol[i] << " ";
	fout << "\n";
}

void Back(int k)
{
	for (int i = sol[k - 1] + 1; i <= m && i <= m - n + k; i++)
		if (!fr[i])
		{
			sol[k] = i;
			fr[i] = 1;
			if (k == n)
				Afis();
			else
				Back(k + 1);
			fr[i] = 0;
		}
}

int main()
{
	fin >> m >> n;
	Back(1);
	fin.close();
	fout.close();
	return 0;
}