#include <bits/stdc++.h>
using namespace std;

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

int n, k, arr[25];

inline void backtracking(int x)
{
    for(int i=arr[x-1]+1;i<=n;++i)
    {
        arr[x] = i;
        if(x == k)
        {
            for(int i=1;i<=k;++i)
            {
                fout << arr[i] << ' ';
            }
            fout << '\n';
        }
        else
        {
            backtracking(x+1);
        }
    }
}

inline void solve()
{
    backtracking(1);
}

int main()
{
    fin >> n >> k;
    solve();
}