#include <iostream>
#include <deque>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int nn, k;
deque<int>q;
void back_track(int n,int p)
{
 if ( n == k+1)
 {
     for ( auto c:q)
        out << c << " ";
     out << "\n";
     return;
 }
 for ( int i = p; i <= nn ; ++i )
 {
     q.emplace_back(i);
     back_track(n+1, i+1);
     q.pop_back();
 }
}
int main()
{
    in >> nn >> k;
    back_track(1, 1);
    return 0;
}