#include<iostream> 
#include<fstream>                                // TOMI NEBUNU
#include<algorithm>                                 // LA IMPLEMENTARE
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int main ()
{            
  int n,i,a[100000],vm,j,k;
  in>>n; in>>k;

  for (i=1;i<=k;i++)
      a[i]=i;
   
   
   while (a[0] == 0) 
  {

	// afisez subm
	for (i = 1; i <= k; i++)
		out<<a[i]<<" ";
		
	out << "\n";
	
	
	// urmatoarea subm.
	vm = n; i = k;
	 while (a[i] == vm) 
	 {
		i--;
		vm--;
     }
    
	    a[i]++;
    
	for (j = i+1; j <= k; j++)
	     a[j] = a[j-1] + 1;
  }
  
  return 0;
}