#include <iostream>
#include <algorithm>
#include <fstream>

using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int main()
{
    int v[20];
    int n, k;
    f>>n>>k;
    for(int i=1;i<=n;i++){
        if(i<=k)
            v[i]=0;
        else v[i]=1;
    }
    do
    {
        for(int i=1;i<=n;i++){
            if(v[i]==0)
                g<<i<<" ";
        }
        g<<"\n";
    }while(next_permutation(v+1,v+n+1));
    return 0;
}