#include<cstdio>

const int MAX_N = 101;

int n,k;
int sel[MAX_N],sol[MAX_N];

void back(int level)
{
	if(k+1 == level)
	{
		for(int i=1;i<=k;++i)
			printf("%d ",sol[i]);
		printf("\n");
		return ;
	}
	for(int i=sol[level-1]+1;i<=n;++i)
	{
		if(sel[i]==0)
		{
			sel[i]=1;
			sol[level]=i;
			back(level+1);
			sel[i]=0;
		}
	}
}

int main()
{
	freopen("combinari.in","r",stdin);
	freopen("combinari.out","w",stdout);
	scanf("%d%d",&n,&k);
	back(1);
	return 0;
}