#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
 int a[20],n,k;
int main()
{
    f>>n>>k;
    for(int i=1;i<=k;i++){
        a[i]=1;
    }
    do{
        for(int i=1;i<=n;i++){
            if(a[i]) g<<i<<" ";
        }
        g<<"\n";
    } while(prev_permutation(a+1,a+n+1));
    return 0;
}