#include <bits/stdc++.h>

using namespace std;

int n, m, a[18];
bitset<18> viz;

void bk(int k)
{
    if(k == n)
    {
        for(int i = 0; i<n; i++)
            cout<<a[i] + 1<<' ';
        cout<<'\n';
        return;
    }
    for(int i = (k != 0 ? a[k-1] + 1 : 0); i<m; i++)
        if(!viz[i])
        {
            viz[i] = 1;
            a[k] = i;
            bk(k + 1);
            viz[i] = 0;
        }
}

int main()
{
    freopen("permutari.in", "rt", stdin);
    freopen("permutari.out", "wt", stdout);
    cin>>n>>m;
    bk(0);
    return 0;
}