#include <bits/stdc++.h>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
long long n, m, a, st[56], p;

void afis()
{
    int i = 0;
    for(i = 1; i <= p; i++)
        g << st[i] << " ";
    g << "\n";
}

void back(int k)
{
    int i = 0, j = 0, ok = 0;
    if(k > p)
        afis();
    else
    {
        for(i = st[k - 1] + 1; i <= n; i++)
        {
            st[k] = i;
            ok = 1;
            for(j = 1; j <= k - 1; j++)
                if(st[j] == st[k])
                {
                    ok = 0;
                    break;
                }
            if(ok == 1)
                back(k + 1);
        }
    }
}

int main()
{
    f >> n >> p;
    back(1);
    return 0;
}