#include <fstream>

using namespace std;

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

int s[20], n, p;

void bk (int k)
{
    for (int i = s[k-1] + 1; i <= n; i ++)
    {
        s[k] = i;

        if (k == p)
        {
            for (int j = 1; j <= p; j ++)
                g << s[j] << " ";
            g << '\n';
        }

        else
            bk (k + 1);
    }
}

int main()
{
    f >> n >> p;

    bk (1);

    f.close ();
    g.close ();
    return 0;
}