write a go solution for F. Two Subarraystime limit per test3 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputYou are given two integer arrays a and b, both of size n.Let's define the cost of the subarray [l,r] as a_l+a_l+1+*s+a_r-1+a_r+b_l+b_r. If l=r, then the cost of the subarray is a_l+2*b_l.You have to perform queries of three types:   "1 p x" — assign a_p:=x;  "2 p x" — assign b_p:=x;  "3 l r" — find two non-empty non-overlapping subarrays within the segment [l,r] with the maximum total cost and print their total cost. InputThe first line contains a single integer n (2<=n<=2*10^5).The second line contains n integers a_1,a_2,...,a_n (-10^9<=a_i<=10^9).The third line contains n integers b_1,b_2,...,b_n (-10^9<=b_i<=10^9).The fourth line contains a single integer q (1<=q<=2*10^5).The next q lines contain the queries: one per line. Each query is of one of three types:   "1 p x" (1<=p<=n; -10^9<=x<=10^9);  "2 p x" (1<=p<=n; -10^9<=x<=10^9);  "3 l r" (1<=l<r<=n). It is guaranteed that there is at least one query of the third type.OutputFor each query of the third type, print the maximum possible total cost of two non-empty non-overlapping subarrays within the segment [l,r].ExamplesInput73 -1 4 -3 2 4 00 6 1 0 -3 -2 -163 1 71 2 03 3 62 5 -31 3 23 1 5Output18
7
16
Input102 -1 -3 -2 0 4 5 6 2 52 -4 -5 -1 6 2 5 -6 4 2103 6 71 10 -23 5 73 2 82 1 -52 7 43 1 33 3 83 2 31 4 4Output23
28
28
-17
27
-22. Output only the code with no comments, explanation, or additional text.