#include <iostream>
#include <fstream>

using namespace std;

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

long long sir[]={0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20};
long long n, k;
void combinari(long long l)
{
    long long i;
    if (l==k)
    {
        for (i=1; i<=k; i++)
        {
            g<<sir[i]<<' ';
        }
        g<<endl;
    }
    else
    {
        for (i=sir[l]+1; i<=n; i++)
        {
            sir[l+1]=i;
            combinari(l+1);
        }
    }
}
int main()
{
    f>>n>>k;
    combinari(0);

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