#include <iostream.h>

long long int ok,i,k,n,m,x[2000000];

int main()
{

  freopen("combinari.in", "r", stdin);
  freopen("combinari.out", "w", stdout);


  cin>>n>>m;
k=1; x[k]=0;
  while (k>0)
{
  ok=0;
    while ((ok==0)&&(x[k]<n))
    {
      ++x[k];  ok=1;
         for (i=1;i<k;++i)
          if (x[i]==x[k])
            ok=0;
    }

    if (ok==1)
    {
       if (k==n)
      {
         for (i=1;i<=m;++i)
           cout<<x[i]<<" ";
	   cout<<endl;
      }
          else
          {
            ++k;x[k]=0;
           }
    }
   else
     {
     --k;
     }
}

return 0;


}