#include <cstdio>

using namespace std;

int n;
int k;
int a[20];

void afis()
{
    for (int i = 1; i <= k; ++ i){
        printf ("%d ", a[i]);
    }
    printf ("\n");
}

void back (int poz)
{
    if (poz > k){
        afis();
        return;
    }
    int m = n - k + poz;
    for (int i = a[poz - 1] + 1; i <= m; ++ i){
        a[poz] = i;
        back (poz + 1);
    }
}

int main()
{
    freopen ("combinari.in", "r", stdin);
    freopen ("combinari.out", "w", stdout);
    scanf ("%d %d", &n, &k);
    back (1);

    return 0;
}