#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
int n,k;
vector<int>v,v2;
vector<int>rasp[500005];
int nr=-1;
void backtracking(int val)
{
    if(val==0)
    {
        if(v.size()!=k)
            return ;
        rasp[++nr]=v;
        sort(rasp[nr].begin(), rasp[nr].end());
        return ;
    }
    backtracking(val-1);

    v.push_back(val);
    backtracking(val-1);
    v.pop_back();
}
int main()
{
    cin>>n>>k;
    backtracking(n);
    sort(rasp, rasp+nr+1);
    for(int i=0; i<=nr; i++)
    {
        for(int j=0; j<k; j++)
            cout<<rasp[i][j]<<" ";
        cout<<'\n';
    }
    return 0;
}