{"raw_statement":[{"iden":"problem statement","content":"For an integer $N$ greater than or equal to $2$, there are $\\frac{N(N - 1)}{2}$ pairs of integers $(x, y)$ such that $1 \\leq x \\lt y \\leq N$.\nConsider the sequence of these pairs sorted in the increasing lexicographical order. Let $(x_1, y_1), \\dots, (x_{R - L + 1}, y_{R - L + 1})$ be its $L$\\-th, $(L+1)$\\-th, $\\ldots$, and $R$\\-th elements, respectively. On a sequence $A = (1, \\dots, N)$, We will perform the following operation for $i = 1, \\dots, R-L+1$ in this order:\n\n*   Swap $A_{x_i}$ and $A_{y_i}$.\n\nFind the final $A$ after all the operations.\nWe say that $(a, b)$ is smaller than $(c, d)$ in the lexicographical order if and only if one of the following holds:\n\n*   $a \\lt c$\n*   $a = c$ and $b \\lt d$"},{"iden":"constraints","content":"*   $2 \\leq N \\leq 2 \\times 10^5$\n*   $1 \\leq L \\leq R \\leq \\frac{N(N-1)}{2}$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $L$ $R$"},{"iden":"sample input 1","content":"5 3 6"},{"iden":"sample output 1","content":"5 1 2 3 4\n\nConsider the sequence of pairs of integers such that $1 \\leq x \\lt y \\leq N$ sorted in the increasing lexicographical order. Its $3$\\-rd, $4$\\-th, $5$\\-th, and $6$\\-th elements are $(1, 4), (1, 5), (2, 3), (2, 4)$, respectively.\nCorresponding to these pairs, $A$ transitions as follows.\n$(1, 2, 3, 4, 5) \\rightarrow (4, 2, 3, 1, 5) \\rightarrow (5, 2, 3, 1, 4) \\rightarrow (5, 3, 2, 1, 4) \\rightarrow (5, 1, 2, 3, 4)$"},{"iden":"sample input 2","content":"10 12 36"},{"iden":"sample output 2","content":"1 10 9 8 7 4 3 2 5 6"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}