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