write a go solution for J. Jumbled Treestime limit per test3 secondsmemory limit per test1024 megabytesinputstandard inputoutputstandard outputYou are given an undirected connected graph with n vertices and m edges. Each edge has an associated counter, initially equal to 0. In one operation, you can choose an arbitrary spanning tree and add any value v to all edges of this spanning tree. Determine if it's possible to make every counter equal to its target value x_i modulo prime p, and provide a sequence of operations that achieves it.InputThe first line contains three integers n, m, and p — the number of vertices, the number of edges, and the prime modulus (1<=n<=500; 1<=m<=1000; 2<=p<=10^9, p is prime).Next m lines contain three integers u_i, v_i, x_i each — the two endpoints of the i-th edge and the target value of that edge's counter (1<=u_i,v_i<=n; 0<=x_i<p; u_ineqv_i). The graph is connected. There are no loops, but there may be multiple edges between the same two vertices.OutputIf the target values on counters cannot be achieved, print -1. Otherwise, print t — the number of operations, followed by t lines, describing the sequence of operations. Each line starts with integer v (0<=v<p) — the counter increment for this operation. Then, in the same line, followed by n-1 integers e_1, e_2, ... e_n-1 (1<=e_i<=m) — the edges of the spanning tree.The number of operations t should not exceed 2m. You don't need to minimize t. Any correct answer within the 2m bound is accepted. You are allowed to repeat spanning trees.ExamplesInput3 3 101
1 2 30
2 3 40
3 1 50
Output3
10 1 2
20 1 3
30 2 3Input2 2 37
1 2 8
1 2 15
Output2
8 1
15 2Input5 4 5
1 3 1
2 3 2
2 5 3
4 1 4
Output-1. Output only the code with no comments, explanation, or additional text.