#include<fstream>

using namespace std;

ifstream fin("combinari.in");
ofstream fout("combinari.out");

int  n,k,v[20];

void back(int p, int k, int n)
{
    int i = 0;
    if (p == k+1)
    {
        for (i=1; i<=k; i++)
            fout << v[i] << " ";
        fout << "\n";
    }
    else
    {
        for (i=v[p-1]+1; i<=n; i++)
        {
            v[p] = i;
            back(p+1, k, n);
        }
    }
}
int main()
{
    fin >> n >> k;
    back(1, k, n);
    //calcularea combinarilor
    //folosind triunghiul lui pascal
    //ce se face doar sub diagonala principala
    /*
    comb[0][1] = 1;
    for (i=1; i<=k; i++)
    {
        comb[i][0] = comb[i][i] = 1;
        for (j=1; j<i; j++)
            comb[i][j] = comb[i-1][j]+comb[i-1][j-1];
    }
    */
    return 0;
}