#include<fstream>
#define maxn 20

using namespace std;

int s[maxn], n, m;
ofstream g("combinari.out");

void back(int k) {
    for (int i = s[k-1]+1; i <= n; i++) {
        s[k] = i;
        int j = 0;
        for (j = 1; j <= k-1; j++)
            if (s[j] == i)
                break;
        if (j == k) {
            if (k == m) {
                for (int l = 1; l <= k; l++) 
                    g << s[l] << " ";
                g << '\n';    
            }
            else 
                back(k+1);    
        }   
    }   
}

int main() {
    ifstream f("combinari.in");
    f >> n >> m;
    
    back(1);
    
    return 0;    
}