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


using namespace std;

int main()
{
    ifstream cin("combinari.in");
    ofstream cout("combinari.out");
         

    int N, K;
    cin >> N >> K;

    vector<int> back;
    back.push_back(0);

    while(!back.empty()){
        
        if(back[back.size() - 1] < N){
            ++back[back.size() - 1];
            if(back.size() == K){
                for(int i = 0; i < back.size(); ++i)
                    cout << back[i] << " ";
                cout << "\n";
            }
            else back.push_back(back[back.size() - 1]);
        }
        else back.pop_back();
    }
  
    cin.close();
    cout.close();

    return 0;
}