#include<fstream>
#define nmax 100
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");

int p[nmax],used[nmax],n,m;

void print()
{
    for(int i=1; i<=m; i++) g<<p[i]<<" ";
    g<<"\n";
}

void combinari(int k)
{
    if(k>m) print();
    else
    {
        for(int i=1; i<=n; i++)
        {
            if(!used[i] && (p[k-1]<i))
            {
                p[k]=i;
                used[i]=1;
                combinari(k+1);
                used[i]=0;
            }
        }
    }
}

int main()
{
    f>>n>>m;
    combinari(1);
    f.close();g.close();
    return 0;
}