#include <cstring>
#include <cstdio>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#define MaxN 20
using namespace std;

FILE*IN,*OUT;

int N,K,Out[MaxN];

void Back(int x,int lvl)
{
	if(lvl==K)
	{
		for(int i=1;i<=K;i++)
			fprintf(OUT,"%d ",Out[i]);
		fprintf(OUT,"\n");
	}
	else
	{
		for(int i=x+1;i<=N;i++)
			Out[1+lvl]=i,Back(i,lvl+1);
	}
}

int main()
{
	IN=fopen("combinari.in","r");
	OUT=fopen("combinari.out","w");

	fscanf(IN,"%d%d",&N,&K);
	Back(0,0);
	return 0;
}