#include <fstream>
#include <bitset>
using namespace std;

ifstream fi ("combinari.in");
ofstream fo ("combinari.out");
int n, k, v[19], c = 1;
bitset <19> bs;

void bkt (int pos)
{
    if (pos == n + 1)
    {
        for (int i = 1; i < pos; ++i)
            fo << v[i] << ' ';
        fo << '\n';
        return ;
    }
    for (int i = v[pos-1]; i <= k; ++i)
        if (!bs[i])
        {
            v[pos] = i, bs[i] = 1;
            bkt(pos + 1);
            bs[i] = 0;
        }
}

int main ()
{
    fi >> k >> n;
    v[0] = 1;
    bkt(1);
    return 0;
}