#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;

int state[26];
bool used[26];
int n, m;

void dfs(int u)
{
   if (u > m)
   {
       for (int i = 1; i <= m; i++)
            printf("%d ", state[i]);
       printf("\n");
       return;
   }

   for (int i = 1; i <= n; i++)
        if (!used[i] && i > state[u-1])
        {
            state[u] = i;
            used[i] = true;
            dfs(u + 1);
            state[u] = 0;
            used[i] = false;
        }
}


int main()
{
    scanf("%d%d", &n, &m);

    dfs(1);

    return 0;
}