#include<stdio.h>

int m,n,put[20],sol[20];

void afis(int k)
{
	for (int i=1;i<=k-1;i++)
		printf("%d ",sol[i]);
	printf("\n");
}

void back(int k)
{
	int i;
	if (k==m+1) afis(k);
	for (i=sol[k-1]+1;i<=n;i++)
		if (!put[i])
		{
			put[i]=1;
			sol[k]=i;
			back(k+1);
			put[i]=0;
		}
}



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