#include <fstream>

using namespace std;

ifstream cin("combinari.in");
ofstream cout("combinari.out");

int sol[20] ;
int n,k;

void back(int left)
{
    int i;

    /// base condition
    if (left==k){
        for (int i=1;i<=k;i++)
            cout << sol[i]<<' ';

        cout << endl;
    }
    else /// recursive function
    {
        for(int i = sol[left]+1; i <= n ; i++)
        {
            sol[left+1]=i;
            back(left+1);
        }
    }
}

int main()
{
    cin>>n>>k;
    back(0);
    return 0;
}