#include <bits/stdc++.h>
using namespace std;
const int N = 5009;
int k;
namespace solve {
int a[N], b[N], m;
multiset<pair<int, int> > s;
void work() {
    int i, j;
    pair<int, int> p1, p2;
    s.clear();
    for (i = 1; i <= m + 1; ++i) s.insert(make_pair(a[i], b[i]));
    for (i = 1; i <= m; ++i) {
        p1 = *s.begin(), p2 = *(--s.end());
        if (p1.second == p2.second)
            printf("%d %d\n", p1.second, k);
        else
            printf("%d %d %d %d\n", p1.second, p1.first, p2.second, k - p1.first);
        s.erase(s.begin()), s.erase(--s.end()), s.insert(make_pair(p2.first - (k - p1.first), p2.second));
    }
}
}  // namespace solve
const int M = 2500009;
int d[N], e[N], q[M], pre[M], id[M];
bool f[M], g[N];
struct P {
    int d, id;
    inline bool operator<(P a) const { return d > a.d; }
} p[N];
int main() {
    int T, i, j, l, r, n, m, t, t2;
    scanf("%d", &T);
    while (T--) {
        scanf("%d%d%d", &n, &m, &k);
        for (i = 1; i <= n; ++i) scanf("%d", d + i), e[i] = i;
        if (m == n - 2) {
            for (i = 1; i <= n; ++i) p[i].d = d[i] - k, p[i].id = i;
            sort(p + 1, p + n + 1), memset(f, 0, sizeof(f)), f[k] = 1, q[t = 1] = k;
            for (i = 1; i <= n; ++i) {
                l = p[i].d, t2 = t;
                for (j = 1; j <= t2; ++j) {
                    r = q[j] + l;
                    if (r >= 0 && !f[r])
                        f[q[++t] = r] = 1, pre[t] = j, id[t] = i;
                }
                if (f[0])
                    break;
            }
            if (!f[0])
                puts("-1");
            else {
                memset(g, 0, sizeof(g));
                for (j = 1; j <= t; ++j) {
                    if (!q[j]) {
                        l = j;
                        while (l != 1) g[p[id[l]].id] = 1, l = pre[l];
                        break;
                    }
                }
                for (i = 1, t = 0; i <= n; ++i) {
                    if (g[i])
                        solve::a[++t] = d[i], solve::b[t] = i;
                }
                solve::m = t - 1, solve::work();
                for (i = 1, t = 0; i <= n; ++i) {
                    if (!g[i])
                        solve::a[++t] = d[i], solve::b[t] = i;
                }
                solve::m = t - 1, solve::work();
            }
            continue;
        }
        if (m >= n) {
            t = 1;
            while (n - 1 != m) {
                while (d[t] == 1) ++t;
                --d[t], d[++n] = 1, e[n] = t;
            }
        }
        for (i = 1; i <= n; ++i) solve::a[i] = d[i], solve::b[i] = e[i];
        solve::m = m, solve::work();
    }
    return 0;
}