#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


int N, M, K;
vector<int> D;

struct Dish {
  int u, v;
  int x, y;
};
vector<Dish> solve(const vector<int> &us, int m) {
  const int n = us.size();
  vector<pair<int, int>> ps;
  for (const int u : us) {
    ps.emplace_back(D[u], u);
  }
  vector<Dish> ans(m);
  for (int i = 0; i < m; ++i) {
    int remain = 0;
    int jm = -1;
    for (int j = 0; j < n; ++j) if (ps[j].first > 0) {
      ++remain;
      if (!~jm || ps[jm].first < ps[j].first) {
        jm = j;
      }
    }
    assert(m - i >= remain - 1);
    if (m - i > remain - 1 && ps[jm].first >= K) {
      ans[i] = Dish{ps[jm].second, -1, K, 0};
      ps[jm].first -= K;
    } else {
      for (int j = 0; j < n; ++j) if (jm != j && ps[j].first > 0) {
        if (ps[jm].first + ps[j].first >= K && ps[j].first < K) {
          const int y = ps[j].first;
          ans[i] = Dish{ps[jm].second, ps[j].second, K - y, y};
          ps[jm].first -= (K - y);
          ps[j].first -= y;
          goto found;
        }
      }
      assert(false);
     found:{}
    }
  }
  return ans;
}

bitset<5'000'010> dp[510];

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d%d%d", &N, &M, &K);
    D.resize(N);
    for (int u = 0; u < N; ++u) {
      scanf("%d", &D[u]);
    }
cerr<<"N = "<<N<<", M = "<<M<<endl;
    
    vector<Dish> ans;
    if (M == N - 2) {
      for (int u = 0; u <= N; ++u) {
        dp[u].reset();
      }
      dp[N].set(N * K);
      for (int u = N; --u >= 0; ) {
        const int d = D[u] - K;
        if (d >= 0) {
          dp[u] = dp[u + 1] | dp[u + 1] << d;
        } else {
          dp[u] = dp[u + 1] | dp[u + 1] >> -d;
        }
      }
      if (dp[0][N * K - K]) {
        int t = N * K - K;
        vector<int> uss[2];
        for (int u = 0; u < N; ++u) {
          assert(dp[u][t]);
          if (dp[u + 1][t]) {
            uss[0].push_back(u);
          } else {
            uss[1].push_back(u);
            t -= (D[u] - K);
          }
        }
        assert(t == N * K);
        for (int h = 0; h < 2; ++h) {
          const auto res = solve(uss[h], (int)uss[h].size() - 1);
          ans.insert(ans.end(), res.begin(), res.end());
        }
      }
    } else {
      vector<int> us(N);
      for (int u = 0; u < N; ++u) {
        us[u] = u;
      }
      ans = solve(us, M);
    }
    
    if (!ans.empty()) {
      assert((int)ans.size() == M);
      for (const auto &dish : ans) {
        if (!~dish.v) {
          printf("%d %d\n", dish.u + 1, dish.x);
        } else {
          printf("%d %d %d %d\n", dish.u + 1, dish.x, dish.v + 1, dish.y);
        }
      }
    } else {
      puts("-1");
    }
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}