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

using namespace std;

int n,k,nrf,a[19],m,i;

int main()
{
    ifstream f ("combinari.in");
    ofstream g ("combinari.out");
    f>>n>>k;
    for(i=n;i>=n-k+1;i--)a[i]=1;
    do{
      for(i=n;i>=1;i--)
        if(a[i])g<<n-i+1<<" ";
      g<<'\n';
    }while(next_permutation(a+1,a+n+1));
    f.close ();
    g.close ();
    return 0;
}