write a go solution for B. Minimize Equal Sum Subarraystime limit per test1.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIt is known that Farmer John likes Permutations, but I like them too!— Sun Tzu, The Art of Constructing PermutationsYou are given a permutation^∗ p of length n.Find a permutation q of length n that minimizes the number of pairs (i,j) (1<=i<=j<=n) such that p_i+p_i+1+ldots+p_j=q_i+q_i+1+ldots+q_j.^∗A permutation of length n is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation (2 appears twice in the array), and [1,3,4] is also not a permutation (n=3 but there is 4 in the array).InputThe first line contains t (1<=qt<=q10^4) — the number of test cases.The first line of each test case contains n (1<=n<=2*10^5).The following line contains n space-separated integers p_1,p_2,ldots,p_n (1<=p_i<=n) — denoting the permutation p of length n.It is guaranteed that the sum of n over all test cases does not exceed 2*10^5.OutputFor each test case, output one line containing any permutation of length n (the permutation q) such that q minimizes the number of pairs.ExampleInput321 251 2 3 4 574 7 5 1 2 6 3Output2 1
3 5 4 2 1
6 2 1 4 7 3 5NoteFor the first test, there exists only one pair (i,j) (1<=qi<=qj<=qn) such that p_i+p_i+1+ldots+p_j=q_i+q_i+1+ldots+q_j, which is (1,2). It can be proven that no such q exists for which there are no pairs.. Output only the code with no comments, explanation, or additional text.