模拟next_permutation
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int n, m;
const int N = 10;
int path[N];
bool st[N];
void dfs(int u)
{
if (u == m)
{
int sum = 0;
for(int i = 0; i < m; i ++ )
if (path[i] < path[i + 1]) sum ++;
if(sum == m - 1)
{
for(int i = 0; i < m; i ++ )
printf("%d ", path[i]);
puts("");
}
return;
}
for(int i = 1; i <=n; i ++ )
{
if(!st[i])
{
path[u] = i;
st[i] = true;
dfs(u + 1);
st[i] = false;
}
}
}
int main()
{
cin >> n >> m;
dfs(0);
return 0;
}