#include <fstream>

using namespace std;

int n, k, s;
char x[1000];

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

void bkt(int i, int last) {
    int lim = n - k + i;
    for(int j = last + 1; j <= lim; j ++) {
        if(j < 10) x[s] = j + '0', s ++, x[s] = ' ', s ++;
        else x[s] = '1', s ++, x[s] = j - 10 + '0', s ++, x[s] = ' ', s ++;
        if(i == k) {
            s --;
            x[s] = '\n';
            g << x;
            s ++;
        }
        else bkt(i + 1, j);
        if(j < 10) x[s] = x[s - 1] = 0, s -= 2;
        else x[s] = x[s - 1] = x[s - 2] = 0, s -= 3;
    }
}

int main()
{
    f >> n >> k;
    bkt(1, 0);
    return 0;
}