write a go solution for E. Klee's SUPER DUPER LARGE Array!!!time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputKlee has an array a of length n containing integers [k,k+1,...,k+n-1] in that order. Klee wants to choose an index i (1<=i<=n) such that x=|a_1+a_2+...+a_i-a_i+1-...-a_n| is minimized. Note that for an arbitrary integer z, |z| represents the absolute value of z. Output the minimum possible value of x.InputThe first line contains t (1<=t<=10^4) — the number of test cases.Each test case contains two integers n and k (2<=n,k<=10^9) — the length of the array and the starting element of the array.OutputFor each test case, output the minimum value of x on a new line.ExampleInput42 27 25 31000000000 1000000000Output1
5
1
347369930
NoteIn the first sample, a=[2,3]. When i=1 is chosen, x=|2-3|=1. It can be shown this is the minimum possible value of x.In the third sample, a=[3,4,5,6,7]. When i=3 is chosen, x=|3+4+5-6-7|=1. It can be shown this is the minimum possible value of x.. Output only the code with no comments, explanation, or additional text.