#include<iostream>
#include<fstream>

using namespace std;

ifstream f("combinari.in");
ofstream g("combinari.out");

int i,k,sol[20],ap[20],z,n,j,ok,K;

void print()
{ 
 for(i=1;i<=K;i++)
  g << sol[i] << " ";
  g << endl;
}
  
 
 /*int sort (int sol[])
  { 
	ok = 1;
	for(i=1;i<=k;i++)
		for(j=i+1;j<=k;j++)
			if (sol[i] > sol[j])
                  ok=0;
	return ok;
  }	*/
 
 void back(int k)
{ 
 int i;
     for(i=sol[k-1]+1;i<=n;i++)
      if(!ap[i])
         {
          ap[i] = 1;
          sol[k] = i;
          if(k<K)
          back(k+1);
		  else
             print();
          ap[i]=0; } 
}
 
 int main() 
{
f >> n;
f >> K;
back(1);
return 0;
}