write a go solution for H. Sea, You & copriMetime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output Umi is given an array a of length n, whose elements are integers between 1 and m. She loves coprime integers and wants to find four distinct indices p,q,r,s (1<=p,q,r,s<=n), such that gcd(a_p,a_q)=1 and gcd(a_r,a_s)=1^∗.If there are multiple solutions, you may output any one of them.^∗gcd(x,y) denotes the greatest common divisor (GCD) of integers x and y. InputEach test contains multiple test cases. The first line contains the number of test cases t (1<=t<=10^4). The description of the test cases follows. The first line of each test case contains two integers n and m (4<=n<=2*10^5,1<=m<=10^6).The second line of each test case contains n integers a_1,a_2,...,a_n (1<=a_i<=m).It is guaranteed that the sum of n over all test cases does not exceed 2*10^5, and that the sum of m over all test cases does not exceed 10^6.OutputFor each test case:  If no such set of four distinct indices exists, output one integer 0.  Otherwise, output four distinct integers p,q,r,s (1<=p,q,r,s<=n) that satisfy the condition. If there are multiple solutions, output any one of them. ExampleInput54 154 7 9 154 101 2 4 85 156 10 11 12 155 156 10 11 14 156 1000030 238 627 1001 1495 7429Output1 3 2 4
0
0
3 1 4 5
1 4 2 3
NoteIn the first test case, gcd(a_1,a_3)=gcd(4,9)=1, gcd(a_2,a_4)=gcd(7,15)=1.In the second test case, it can be shown that no such quadruple exists.. Output only the code with no comments, explanation, or additional text.