#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
vector <vector <int> > v;
int main()
{
    int n, k;
    in >> n >> k;
    for(int i = 1; i < (1 << n); i++)
    {
        int cnt = 0;
        for(int j = 0; j < n ; j++)
            if(i & (1 << j))
                cnt ++;
        if(cnt == k)
        {
            vector <int> act;
            for(int j = 0; j < n ; j++)
                if(i & (1 << j))
                    act.push_back(j + 1);
            v.push_back(act);
        }
    }
    sort(v.begin(), v.end());
    for(auto vect : v) {
        for(auto it : vect)
            out << it << ' ';
        out << '\n';
    }
    return 0;
}