#include <iostream>
#include <fstream>
using namespace std;
int *x, nrsol = 0;
ifstream f("combinari.in");
ofstream g("combinari.out");

void afis(int x[], int n)
{
    for(int i = 1; i <= n; i++)
        g << x[i] << ' ';
    g << '\n';
}

void backt(int n, int m)
{
    int k = 1;
    x[1] = 0;
    while(k > 0)
        if(x[k] < n - m + k)
        {
            x[k]++;
            if(k == m)
                afis(x, m);
            else
            {
                k++;
                x[k] = x[k - 1];
            }
        }
        else
            k--;
}

int main()
{
    int N, K;
    f >> N >> K;
    x = new int [K + 1];
    backt(N, K);
    return 0;
}