#include <bits/stdc++.h>
using namespace std;
#define ll long long
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void find_comb(vector<vector<int>>& res,vector<int> temp, int ind ,int st, int end,int k)
{
     if(ind == k)
{
     res.push_back(temp);
return;
}
for(int i = st;i<end && end-i+1 >= k-ind;i++)
{
   temp[ind] = i+1;
   find_comb(res,temp,ind+1,i+1,end,k);
}
}

int main()
{
 int n, k; fin>>n>>k;
    vector< vector<int> > res;
    vector<int> temp(k,0);
   find_comb(res,temp,0,0,n,k);
 for(int i=0;i<res.size();i++)
{
   for(int j=0;j<res[i].size();j++)
{

    fout<< res[i][j] << " " ;
  }
fout<< "\n";
}
return 0;
}