#include <iostream>
#include <fstream>
using namespace std;

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

int n , k , st[20];

void back( int p)
{
    if ( p == k+1 )
    {
        for ( int i = 1; i <= k ; i++ )
            g << st[i] << " " ;
        g << "\n";
    }
    else
    {
        for ( int i = st[p-1]+1; i <= n ; i++ )
        {
            st[p] = i;
            back(p+1);
        }
    }
}

int main()
{

    f >> n >> k;
    back(1);

    return 0;
}