#include <algorithm>
using namespace std;

#define DIM 20

int sol[DIM];
int n,m;

void back (int k,int m,int p)
{
    int i,j;

    if (k==m+1)
    {
        for (j=1; j<=m; ++j)
            printf ("%d ",sol[j]);
        printf ("\n");
    }
    else
        for (i=p+1; i<=n; ++i)
        {
            sol[k]=i;
            back (k+1,m,i);
        }
}

int main ()
{
    freopen ("combinari.in","r",stdin);
    freopen ("combinari.out","w",stdout);

    scanf ("%d%d",&n,&m);
    back (1,m,0);
    return 0;
}