#include <iostream>
#include <fstream>

using namespace std;

int n,p,sol[19];

ifstream in("combinari.in");
ofstream out("combinari.out");

void back(int k){

    if(k == p+1){
        for(int i=1;i<=p;i++)
            out<<sol[i]<<" ";
        out<<"\n";
    }
    else{
        if(k>1)
            sol[k]= sol[k-1];
        else
            sol[k]=0;
        while(sol[k]<n-p+k){
            sol[k]++;
            back(k+1);
        }

    }

}

int main()
{
    

    in>>n>>p;
    back(1);






    in.close();
    out.close();
    return 0;
}