#include <fstream>

using namespace std;
int n,k,x[16];
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
int cont (int pas){
    for (int i=1;i<pas;i++)
        if (x[i] == x[pas])
            return 0;
    return 1;
}
void back (int pas){
    if (pas > k){
        for (int i=1;i<=k;i++)
            fout<<x[i]<< " ";
        fout<< "\n";
        return;
    }
    for (int i=1;i<=n;i++){
        x[pas] = i;
        if (x[pas] > x[pas-1] && cont (pas) == 1)
            back (pas+1);
    }


}
int main (){

    fin>>n;
    fin>>k;
    back (1);



    return 0;
}