#include <bits/stdc++.h>
#define Mod 1e9+7
#define N 2e5
#define pb push_back
#define ii pair < int , int >
#define ll long long
#define iter iterator
#define makep make_pair
#define input fin
#define output fout
#define fox(r) {output << r ; return 0;}
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
int r[19];
int n,k;
void b (int pos){
    for(int i = r[pos-1]+1 ;  i <= n - k + pos   ; i ++){
        r[pos]=i;
        if(pos!=k+1)b(pos+1);
    }
    if(pos == k+1){
        for(int i = 1 ; i <= k ; i++){
            output << r[i] << " ";
        }
        output << endl;
        return;
    }
    return;
}
int main(void){
input >> n;
input >> k;
b(1);
}