#include <stdio.h>
int n,p,sol[101];
int check (int i,int k)
{
    int j;
    for (j=1; j<k; ++j)
        if (sol[j]>=i)
            return 0;
    return 1;
}
void print ()
{
    int i;
    for (i=1; i<=p; ++i)
        printf ("%d ",sol[i]);
    printf ("\n");
}
void back (int k)
{
    int i;
    if (k==p+1)
        print ();
    else
        for (i=1; i<=n; ++i)
            if (check (i,k))
            {
                sol[k]=i;
                back (k+1);
            }
}
int main ()
{
    freopen ("combinari.in","r",stdin);
    freopen ("combinari.out","w",stdout);    
    scanf ("%d%d",&n,&p);
    back (1);
    return 0;
    }