#include <cstdio>
using namespace std;
int sol[21], n, m;
bool sel[21];
void afis (void)
{
    for (int i=1; i<=m; i++) printf("%d ",sol[i]); printf("\n");
}
void back (int n, int m, int k)
{
    if (k>m) afis();
    else
    {
        for (int i=sol[k-1]+1; i<=n; i++)
        {
            if (!sel[i])
            {
                sel[i]=true; sol[k]=i;
                back(n,m,k+1); sel[i]=false;
            }
        }
    }
}
int main()
{
    freopen("combinari.in","r",stdin);
    freopen("combinari.out","w",stdout);
    scanf("%d%d",&n,&m);
    back(n,m,1);
    return 0;
}