#include <fstream>
using namespace std;

int n,m;
int x[30];
ifstream fin("combinari.in");
ofstream fout("combinari.out");

int cont(int k) {
    //for (int i=1;i<k;i++)
        //if (x[i] == x[k])
    if(x[k]<=x[k-1]&&k>=2)
        return 0;
    return 1;
}

void sol(int lungime) {
    for (int i=1;i<=lungime;i++)
        fout<<x[i]<<" ";
    fout<<"\n";
}

void back(int k) {
    if (k>m) {
        sol(m);
    } else {
        for (int i= 1;i<=n;i++) {
            x[k] = i;
            if (cont(k))
                back(k+1);
        }
    }

}

int main() {

    fin>>n>>m;

    back(1);
    return 0;

}