#include <fstream>
#include <algorithm>
using namespace std;
ifstream fi("combinari.in");
ofstream fo("combinari.out");
int n,k;
int SOL[20];

int main()
{
    fi>>n>>k;
    for(int i=1;i<=k;i++)
        SOL[i]=1;
    do
    {
        for(int i=1;i<=n;i++)
            if(SOL[i])
                fo<<i<<" ";
        fo<<"\n";
    }while(prev_permutation(SOL+1,SOL+n+1));

    fi.close();
    fo.close();
    return 0;
}