#include <cstdio>

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