#include<cstdio>
using namespace std;
int i,j,n,k,put[20],sol[20];
void back(int p)
{
 if (p==k+1)
	{
	 for (int i=1;i<=k;i++) printf("%d ",sol[i]);
	 printf("\n");
	}
 for (int i=sol[p-1]+1;i<=n;i++)
	if (!put[i])
		{
		 put[i]=1;
		 sol[p]=i;
		 back(p+1);
		 put[i]=0;
		}
}
int main()
{
	freopen("combinari.in","r",stdin);
	freopen("combinari.out","w",stdout);
	scanf("%d%d",&n,&k);
	back(1);
}