#include <iostream>
using namespace std;
int n,k,pas,s[20];
void backtracking(int pas)
{
    if (pas==k+1)
    {
        for (int i=1; i<=k; ++i)
            cout<<s[i]<<" ";
        cout<<"\n";
        return;
    }
    for (int i=s[pas-1]+1; i<=n; ++i)
    {
        s[pas]=i;
        backtracking(pas+1);
    }
}
int main()
{
    cin>>n>>k;
    backtracking(1);
}