#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define sz size()
#define x first
#define y second
#define pi pair <int, int>
#define pii pair <pi, pi>
#define vi vector <int>
const ll mod = 1e9 + 7;
int t[101];
int n, k, cnt;

void print(){
    ofstream cout("combinari.out");
    for(int i=1; i<=n; i++){
        if(t[i]) cout<<i<<" ";
    }
    cout<<'\n';
    return;
}

void solve(int x){
    if(x>n) return;
    if(t[x]==0){
        cnt++;
        t[x]=1;
    }
    if(k==cnt){
            print();
            t[x]=0;
            cnt--;
    }
    solve(x+1);
    if(t[x]!=0) cnt--;
    t[x]=0;
}

int32_t main(){
    ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
    ifstream cin("combinari.in");
    cin>>n>>k;
    solve(1);
}