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

using namespace std;

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

vector<int>v;

void f(int n,int m)
{
    if(v.size()==n)
    {
        for(int i=0;i<n;i++)
            cout<<v[i]<<' ';
        cout<<'\n';
        return;
    }
    for(int i=1;i<=m;i++)
    {
        if(find(v.begin(),v.end(),i)==v.end())
        {
            if(!v.size())
            {
                v.push_back(i);
                f(n,m);
                v.pop_back();
            }
            else if(v[v.size()-1]<i)
            {
                v.push_back(i);
                f(n,m);
                v.pop_back();
            }
        }
    }
}

int main()
{
    int n,m;
    cin>>n>>m;
    f(m,n);
    return 0;
}