#include<fstream> 

using namespace std;

ifstream fi("combinari.in");
ofstream fo("combinari.out");

int a[10],b[10];
int n,k;

void combinari_back(int k,int len, int max)
{
	if(k-1 == max)   //afisam solutia
	{
		for(int i = 1; i <= max;i++)
		fo << a[i];
		fo << '\n';

	}     
	else
	{
		for(int  i = 1; i <= len; i++)
		if(!b[i] && a[k-1] < i)  //daca valoarea nu-i folosita
		{
			a[k] = i; 
			b[i] = 1; //o folosim
			combinari_back(k+1,len, max); //trecem la pasul urmator
 			b[i] = 0; //o eliberam
		} 
	}
}
 
int main()  
{   
    fi >> n >> k;
    combinari_back(1,n,k);  

}