func_code_string: #include <bits/stdc++.h>   using namespace std;   mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());   void rset();   void init_test();   void solve();   signed main() {     ios::sync_with_stdio(false);     cin.tie(0);     cout << fixed;     cout.precision(20);     init_test();     return 0;   }   template <typename T>   void chmin(T& a, T b) {     if (a > b) a = b;   }   template <typename T>   void chmax(T& a, T b) {     if (a < b) a = b;   }   template <typename T>   void MACRO_rdv2_Init(long long n, T& t) {     t.resize(n);   }   template <typename First, typename... Rest>   void MACRO_rdv2_Init(long long n, First& first, Rest&... rest) {     first.resize(n);     MACRO_rdv2_Init(n, rest...);   }   template <typename T>   void MACRO_rdv2_Scan(long long p, T& t) {     std::cin >> t[p];   }   template <typename First, typename... Rest>   void MACRO_rdv2_Scan(long long p, First& first, Rest&... rest) {     std::cin >> first[p];     MACRO_rdv2_Scan(p, rest...);   }   template <typename T>   void wrv(const vector<T>& v) {     for (long long(__ii) = (0); (__ii) < (((long long)v.size())); ++(__ii)) {       if (__ii) cout <<    ;       cout << v[__ii];     }     cout <<   n ;   }   template <typename T>   void wrm(const vector<vector<T>>& v) {     for (long long(__ii) = (0); (__ii) < (((long long)v.size())); ++(__ii)) {       for (long long(__jj) = (0); (__jj) < (v[__ii].size()); ++(__jj)) {         if (__jj) cout <<    ;         cout << v[__ii][__jj];       }       cout <<   n ;     }   }   template <typename T>   void sc(T& x) {     cin >> x;   }   template <typename Head, typename... Tail>   void sc(Head& head, Tail&... tail) {     cin >> head;     sc(tail...);   }   template <typename T>   void wr(const T& x) {     cout << x <<   n ;   }   template <typename Head, typename... Tail>   void wr(const Head& head, const Tail&... tail) {     cout << head <<    ;     wr(tail...);   }   template <typename T>   void wrf(const T& x) {     cout << x << endl;   }   template <typename Head, typename... Tail>   void wrf(const Head& head, const Tail&... tail) {     cout << head <<    ;     wrf(tail...);   }   template <typename T>   void debug_out(const T& x) {     cerr << x <<   n ;   }   template <typename Head, typename... Tail>   void debug_out(const Head& head, const Tail&... tail) {     cerr << head <<    ;     debug_out(tail...);   }   template <typename... T>   void err(const T&... cod) {     wr(cod...);     exit(0);   }   void solve() {     long long n;     sc(n);     vector<long long> a(n);     for (long long(__ii) = (0); (__ii) < (n); ++(__ii)) cin >> a[__ii];     if (accumulate(a.begin(), a.end(), 0LL) % n != 0) {       wr(-1);       return;     };     long long s = accumulate(a.begin(), a.end(), 0LL) / n;     vector<pair<pair<long long, long long>, long long>> ans;     for (long long(i) = (1); (i) < (n); ++(i)) {       if (a[i] % (i + 1)) {         long long k = (i + 1) - (a[i] % (i + 1));         ans.push_back(make_pair(make_pair(1, i + 1), k));         a[i] += k;         a[0] -= k;       }       long long k = a[i] / (i + 1);       ans.push_back(make_pair(make_pair(i + 1, 1), k));       a[0] += k * (i + 1);       a[i] -= k * (i + 1);     }     for (long long(i) = (1); (i) < (n); ++(i)) {       ans.push_back(make_pair(make_pair(1, i + 1), s));       a[0] -= s;       a[i] += s;     }     wr(((long long)ans.size()));     for (long long(i) = (0); (i) < (((long long)ans.size())); ++(i)) {       wr(ans[i].first.first, ans[i].first.second, ans[i].second);     }   }   void init_test() {     long long qq = 1;     cin >> qq;     while (qq--) solve();   }   