/* Metoda de rezolvare foloseste recursivitatea */
#include <stdio.h>
using namespace std;

FILE *g = fopen ("combinari.out","w");
int c[20];
int n, m;

void afisare ()
{
    int i;

    for (i=1; i<=m; ++i)
        fprintf (g,"%d ", c[i]);
    fprintf (g,"\n");
}

void combinari (int k)
{
    int i;
    if (k - 1 == m)
        afisare ();
    else
    {
        for (i=c[k-1]+1; i<=n - m + k; ++i)
        {
            c[k] = i;
            combinari (k + 1);
        }
    }
}

int main ()
{
    FILE *f = fopen ("combinari.in","r");
    fscanf (f,"%d %d", &n, &m);

    combinari (1);

    fclose (f);
    fclose (g);
    return 0;
}