#include <cstdio>

using namespace std;

int n,k,uz[20],sol[20];
void back(int p);
int main()
{
    freopen("permutari.in","r",stdin);
    freopen("permutari.out","w",stdout);
    scanf("%d%d",&n,&k);
    back(1);
    return 0;
}
void back(int p)
{
    int i;
    if(p==k+1)
    {
        for(i=1;i<=k;++i)
            printf("%d ",sol[i]);
        printf("\n");
    }
    else
        for(i=sol[p-1]+1;i<=n;++i)
            if(uz[i]==0)
            {
                uz[i]=1;
                sol[p]=i;
                back(p+1);
                uz[i]=0;
            }
}