#include <iostream>
#include <fstream>
using namespace std;

ifstream in("combinari.in");
ofstream out("combinari.out");

int n, p, sol[20];

int valid(int k)
{
    for (int i=1; i<k; ++i)
     if ( sol[i] >= sol[k] ) return 0; return 1;
}

void back(int k)
{
    if ( k == p+1 )
     {
         for (int i=1; i<=p; ++i)
          out<<sol[i]<<" ";
         out<<'\n';
     }
     else
      for (int i=1; i<=n; ++i)
       {
           sol[k]=i;
           if ( valid(k) )
            back(k+1);
       }

}

int main()
{
    in>>n>>p;
    back(1);

return 0;
}