#include <iostream>
#include <fstream>

using namespace std;

int n,a[20],t;

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

void back(int k){
    int i,j;
    for (i=a[k-1]+1;i<=n;i++){
        a[k]=i;
        if (k==t){
            for(int j=1; j<=t; j++)
			{
                g<<a[j]<<" ";
			}
			g<<"\n";
        }
        else back(k+1);
    }
}

int main()
{
    f>>n>>t;
    back(1);
    return 0;
}