/* Generare permutari folosind backtracking */
#include <cstdio>
int X[10], N, K;

void Generate(int p)
{
    for (int i = X[p] + 1; i <= N - (K - p); i++)
    {
        X[p] = i;
        return;
    }
    Generate(p - 1);
    X[p] = X[p - 1] + 1;
}

int main()
{
    freopen("combinari.in","r",stdin);
    freopen("combinari.out","w",stdout);
    scanf("%d %d", &N, &K);
    for (int i = 1; i <= K; i++)
    {
        X[i] = i;
    }
    do{
        for (int i = 1; i <= K; i++) printf("%d ", X[i]);
        printf("\n");
        Generate(K);
    } while (X[0] == 0);
}