#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <string>
#include <cstring>
#include <deque>
#include <stack>
#include <bitset>
#include <list>
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define mp(a,b) make_pair (a, b)
#define ll long long
#define max(a, b) (a > b ? a : b)
#define min(a, b) (a < b ? a : b)

using namespace std;

int N, K;
int v[19];
ofstream fout ("combinari.out");

void Citire ()
{
    ifstream fin ("combinari.in");
    fin >> N >> K;
    fin.close ();
}

void Recursive (int nr)
{
    if (nr == K + 1)
    {
        for (int i = 1; i <= K; i++)
            fout << v[i] << " ";
        fout << "\n";
        return;
    }
    for (int i = v[nr - 1] + 1; i <= N; i++)
    {
        v[nr] = i;
        Recursive (nr + 1);
    }
}

int main ()
{
    Citire ();
    Recursive (1);
    return 0;
}