#include <fstream>
#include <algorithm>
#define Nmax 20

using namespace std;

string file="combinari";

ifstream f( (file + ".in").c_str() );
ofstream g( (file + ".out").c_str() );

int uz[Nmax], v[Nmax], w[Nmax];
int n, K, fact=1;

void print()
{
    for ( int i = 1; i <= n; i ++ )
    {
        if (v[i] == 0 )
        g << i << " ";
    }
    g << '\n';
}

int main()
{
    f >> n >> K;

    for ( int i = n; i > K; i -- )
       v[i]=1;

       do{

         print();
     }while(next_permutation(v+1, v+n+1) == true);


   /*     for ( int k = 0; k < n; k ++ )
            if(i&(1<<k))
                {
                    v[++cnt]=k+1;
                }


        g << '\n';
    }*/
    /*
    for ( int i = 1; i <= n; i ++ )
    v[i]=i;
    int i = 1;
    do{

         print();
     }while(next_permutation(v+1, v+n+1) == true);
*/

    return 0;
}