#include <cstdio>
using namespace std;
int n,p,x[20];
int bun(int k)
{
   if(x[k]<=x[k-1]&&k>1)
   return 0;
    return 1;
}
void back(int k)
{
    int i;
    if(k>p)
    {
        for(i=1;i<=p;i++)
            printf("%d ",x[i]);
        printf("\n");
        return;
    }
    else
    {
        for(i=1;i<=n;i++)
        {
            x[k]=i;
            if(bun(k))back(k+1);
        }
    }
}
int main()
{
    freopen("combinari.in","r",stdin);
    freopen("combinari.out","w",stdout);
    scanf("%d%d",&n,&p);
    back(1);
    return 0;
}