#include <bits/stdc++.h>

using namespace std;

int stiva[20], n, k1;
bitset <20> viz;

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

void back(int k = 1)
{
    if (k > k1) afis(k);
    else
    for (int i = stiva[k - 1] + 1; i <= n; i++)
        {
            stiva[k] = i;
            back(k + 1);
        }
}

int main()
{
    freopen("combinari.in", "r", stdin);
    freopen("combinari.out", "w", stdout);
    scanf("%d %d", &n, &k1);
    back();
    return 0;
}