#include <iostream>
#include <fstream>

using namespace std;

int N, S;
int V[10];
int K[10];
bool L[10];

ifstream i("combinari.in");
ofstream o("combinari.out");

void backtrack(int x)
{
    if(x == S + 1)
    {
        for(int a = 1; a <= S; a++)
        {
            o << K[a] << " ";
        }

        o << '\n';

        return;
    }

    else
    {
        for(int a = K[x - 1]; a <= N; a++)
        {
            if(!L[a])
            {
                K[x] = V[a];
                L[a] = true;
                backtrack(x + 1);
                L[a] = false;
            }
        }
    }
}

int main()
{
    i >> N >> S;

    K[0] = 1;
    for(int a = 1; a <= N; a++)
    {
        V[a] = a;
    }

    backtrack(1);

    return 0;
}