#include <bits/stdc++.h>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k;
int permutare[19];
void permutari(int pos,int ultim){
    if (pos > k) {
        for (int i = 1; i <=k; ++i) {
            g<<permutare[i]<<" ";
        }
        g<<"\n";
        return;
    } else {
        for(int i = ultim+1; i <=n; i++) {
                permutare[pos] = i;
                permutari(pos + 1,i);

        }
    }
}
int main()
{
    f>>n>>k;
    permutari(1,0);
    return 0;
}