#include <algorithm>
using namespace std;

#define DIM 20

int v[DIM];
int n,k;

void print ()
{
    int i;

    for (i=1; i<=k; ++i)
        printf ("%d ",v[i]);
    printf ("\n");
}

void back (int step,int start)
{
    int i;

    if (step==k+1)
        print ();
    else
        for (i=start+1; i<=n; ++i)
        {
            v[step]=i;
            back (step+1,i);
        }
}

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

    scanf ("%d%d",&n,&k);
    back (1,0);

    return 0;
}