#include<stdio.h>
int n , sol [100] , i , q , m;
int valid ( int j )
{
	if(sol[j]<=sol[j-1])
			return 0;
	return 1;
}
void bkt(int p)
{
	if(p==n+1)
	{
		for(q=1;q<=n;q++)
			printf("%ld ",sol[q]);
		printf("\n");
		return ;
	}
	for(int i=1;i<=m;i++)
		{
			sol[p]=i;
			if(valid(p))
					bkt(p+1);
	}
}
int main()
{
	freopen("combinari.in","r",stdin);
	freopen("combinari.out","w",stdout);
	scanf("%ld%ld",&m,&n);
	bkt(1);
	return 0;
}