#include <iostream>
#include <fstream>

using namespace std;

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

int n,k;
int sol[20];

void backp(int p) {
    for(int i = sol[p-1]+1; i <= n; i++) {
        sol[p] = i;
        if(p == k) {
            for(int j = 1; j <= k; j++)
                out << sol[j] << " ";
            out << '\n';
        } else
            backp(p+1);
    }
}

int main() {
    in >> n >> k;
    backp(1);
    return 0;
}