#include <fstream>
#include <iostream>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <stack>
#include <queue>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int st[10],n,k;
void afis() {
    for (int i=1; i<=k; i++)
        fout<<st[i]<<" ";
    fout<<"\n";
}
void back(int top) {
    for (int i=st[top-1]+1; i<=n-k+top; i++) {
        st[top]=i;
        if (top==k)
            afis();
        else
            back(top+1);
    }
}
int main() {
    fin>>n>>k;
    back(1);
    return 0;
}
// 2 0 3 -1 7 -4