#include <fstream>
#include <vector>
#include <queue>

using namespace std ;

ifstream cin ("combinari.in") ;
ofstream cout ("combinari.out") ;

int n, m, v[20] ;

void out (int step)
{

    for (int i = 1 ; i <= step ; i ++)
        cout << v[i] << ' ' ;

    cout << '\n' ;

}

void backtracking (int step)
{

    for (int i = v[step - 1] + 1 ; i <= n ; i ++)
    {

        v[step] = i ;

        if (step == m)
            out (step) ;

        else
            backtracking(step + 1) ;


    }

}

int main()
{

    cin >> n >> m ;

    backtracking (1) ;

    return 0 ;

}