You are given a permutation(^{\text{∗}}) (p) of length (n). There are also two portals located at positions (x) and (y) ((x \lt y)). A portal at position (i) is initially located between the (i)-th and ((i+1))-th elements of the array. Specifically, if (i=0), then the portal is located before the first element of the array, and if (i=n), then the portal is located after the last element. You may perform either of the following two operations as many times as you like: Remove the element to the immediate left of one portal and insert it to the immediate right of the other portal. Remove the element to the immediate right of one portal and insert it to the immediate left of the other portal. Let (\mathbf{\color{red}{\mathcal{O}}}) denote a portal. For example, if (p) is (3,\mathbf{\color{red}{\mathcal{O}}},2,4,\mathbf{\color{red}{\mathcal{O}}},1): Using operation (1) on the left and right portals respectively results in the arrays (\mathbf{\color{red}{\mathcal{O}}},2,4,\mathbf{\color{red}{\mathcal{O}}},3,1) and (3,\mathbf{\color{red}{\mathcal{O}}},4,2,\mathbf{\color{red}{\mathcal{O}}},1). Using operation (2) on the left and right portals respectively results in the arrays (3,\mathbf{\color{red}{\mathcal{O}}},4,2,\mathbf{\color{red}{\mathcal{O}}},1) and (3,1,\mathbf{\color{red}{\mathcal{O}}},2,4,\mathbf{\color{red}{\mathcal{O}}}). Find the lexicographically(^{\text{†}}) smallest permutation you can obtain using these operations. Note that portals do not affect the lexicographical comparison of permutations. (^{\text{∗}})A permutation of length (n) is an array of length (n) containing each integer from (1) to (n) exactly once. (^{\text{†}})A permutation (a) is lexicographically smaller than permutation (b) if there exists an index (i) such that (a_j = b_j) for all indices (1 \leq j \lt i) and (a_i \lt b_i). The first lin