#include <iostream>
#include <queue>
#include <stack>
#include <map>
#include <cstdio>
#include <cstring>
#include <set>
#include <algorithm>
#include <bitset>
#include <time.h>
#include <fstream>
#include <numeric>
#include <iomanip>

#define nl '\n'
#define sp ' '
#define pb(x) push_back(x)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define forn2(n) for(int i=0;i<n;++i) for(int j=0;j<n;++j)
#define forn1(n, m) for(int i=0;i<n;++i) for(int j=0;j<m;++j)
#define forn(j, n) for(int i=j;i<n;++i)
#define ull unsigned long long
#define ll long long
#define SIZE (1<<9)
using namespace std;

template<class a>
void print(a v) {
    for_each(all(v), [](int x) { cout << x << ' '; });
    cout << nl;
}

int n, k;
vector<int> v(19), ans;

inline void gen() {
    if (ans.size() == k) {
        print(ans);
        return;
    }
    for (int i = 1; i <= n; ++i) {
        if (!v[i]) {
            ++v[i];
            ans.emplace_back(i);
            int t = ans[ans.size() - 1 - (ans.size()>1)];
            if (ans.back() >= t)
                gen();
            ans.pop_back();
            --v[i];
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    freopen("combinari.in","r",stdin);
    freopen("combinari.out","w",stdout);
    cin >> n >> k;
    gen();
}