write a go solution for C. Remove the Endstime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have an array a of length n consisting of non-zero integers. Initially, you have 0 coins, and you will do the following until a is empty:   Let m be the current size of a. Select an integer i where 1<=i<=m, gain |a_i|^∗ coins, and then:   if a_i<0, then replace a with [a_1,a_2,ldots,a_i-1] (that is, delete the suffix beginning with a_i);  otherwise, replace a with [a_i+1,a_i+2,ldots,a_m] (that is, delete the prefix ending with a_i).  Find the maximum number of coins you can have at the end of the process.^∗Here |a_i| represents the absolute value of a_i: it equals a_i when a_i>0 and -a_i when a_i<0.InputThe first line contains an integer t (1<=t<=10^4) — the number of testcases.The first line of each testcase contains an integer n (1<=n<=2*10^5) — the length of a.The second line of each testcase contains n integers a_1,a_2,ldots,a_n (-10^9<=a_i<=10^9, a_ine0).The sum of n across all testcases does not exceed 2*10^5.OutputFor each test case, output the maximum number of coins you can have at the end of the process.ExampleInput363 1 4 -1 -5 -96-10 -3 -17 1 19 2011Output23
40
1
NoteAn example of how to get 23 coins in the first testcase is as follows:   a=[3,1,4,-1,-5,colorred-9]xarrowi=6a=[3,1,4,-1,-5], and get 9 coins.  a=[colorred3,1,4,-1,-5]xarrowi=1a=[1,4,-1,-5], and get 3 coins.  a=[colorred1,4,-1,-5]xarrowi=1a=[4,-1,-5], and get 1 coin.  a=[4,-1,colorred-5]xarrowi=3a=[4,-1], and get 5 coins.  a=[4,colorred-1]xarrowi=2a=[4], and get 1 coin.  a=[colorred4]xarrowi=1a=[], and get 4 coins.  After all the operations, you have 23 coins.An example of how to get 40 coins in the second testcase is as follows:   a=[-10,-3,-17,colorred1,19,20]xarrowi=4a=[19,20], and get 1 coin.  a=[colorred19,20]xarrowi=1a=[20], and get 19 coins.  a=[colorred20]xarrowi=1a=[], and get 20 coins.  After all the operations, you have 40 coins.. Output only the code with no comments, explanation, or additional text.