Problem N: Permutation - Permutation

上一题 正确率: $69.35\%$ 下一题
"
Time Limit $1$ 秒/Second(s) Memory Limit $512$ 兆字节/Megabyte(s)
提交总数 $535$ 正确数量 $371$
裁判形式 标准裁判/Standard Judge 我的状态 尚未尝试
难度 分类标签 STL

Description

For given a sequence A={a0,a1,...,an−1}, print the previous permutation and the next permutation in lexicographic order.

Input

A sequence is given in the following format.

n 

a0 a1...an−1

Output

Print the previous permutation, the given sequence and the next permutation in the 1st, 2nd and 3rd lines respectively. Separate adjacency elements by a space character. Note that if there is no permutation, print nothing in the corresponding line.

Sample Input复制

3
2 1 3
3
3 2 1

Sample Output复制

1 3 2
2 1 3
2 3 1
3 1 2
3 2 1

提示

1≤n≤9 ai consist of 1,2,...,n