#include<cstdio>
int a[19],b[19];
 
void back(int nivel,int n,int k)
{
if(nivel-1 == k) //afisam solutia
{
for(int i = 1; i <= k;i++)
printf("%d ",a[i]);
printf("\n");
}
else
{
for(int  i = 1; i <= n; i++)
if(!b[i] && a[k-1] < i)  
{
a[k] = i;
b[i] = 1; //o folosim
back(k+1,n,k); //trecem la pasul urmator
b[i] = 0;   //o eliberam
}
}
}
 
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
int n,k;
scanf("%d %d",&n,&k);
back(1,n,k);
fclose(stdin); fclose(stdout);
return 0;
}