#include <bits/stdc++.h>

using namespace std;

int maxBits, usedBits;

ifstream fin("combinari.in");
ofstream fout("combinari.out");

set <vector <int> > solutions;

template <class type>
void morphToGroup(type number, vector<int> &result){
    type bit = 1<<(int)(log2(number));
    for ( ;number or bit; bit>>=1 ){
        if ( number - bit >= 0 ){
            result.push_back(log2(bit)+1);
            number -= bit;
        }
    }
    reverse(result.begin(), result.end());
}

inline void solveProblem(){
    int startNumber = (1<<usedBits)-1;
    int stopNumber = (1<<maxBits);
    vector <int> group;

    for ( int index = startNumber; index <= stopNumber; index++ ){
        if ( __builtin_popcount(index) == usedBits ){
            group.clear();
            morphToGroup(index, group);
            solutions.insert(group);
        }
    }
}

inline void displaySolutions(){
    vector <int> :: iterator element;
    for ( auto group : solutions ){
        for ( element = group.begin(); element < group.end(); element++ )
            fout << *element << " ";
        fout << "\n";
    }
}

int main(){
    fin >> maxBits >> usedBits;
    solveProblem();
    displaySolutions();
}