#include <iostream>
#define MAX 1001
#include <cmath>
#include <fstream>

using namespace std;
int v[MAX],n,k;

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

bool valid(int p)
{
    int i;
    for(i=1;i<=k-1;++i)
        if(v[i]==v[p])return false;

     return true;
}

bool solutie(int p)
{
    if(k==p)return true;
    return false;
}

void afisare(int p){
    int i;
    for(i=1;i<=p;++i)
        fout<<v[i]<<" ";
    fout<<endl;
}
void BK(int p)
{
    int i;
    for(i=v[p-1]+1;i<=n;++i)
    {v[p]=i;
        if(solutie(p))afisare(p);
        else BK(p+1);

    }
}
int main()
{
    fin>>n>>k;
    BK(1);
    return 0;
}