#include <bits/stdc++.h>

using namespace std;
using ll = long long;

vector<array<int, 4>> easy(int m, int k, vector<int> ord, vector<int> a) {
    assert(m + 1 >= ord.size());
    set<pair<int, int>> st;
    for (int i : ord) {
        st.emplace(a[i], i);
    }

    vector<array<int, 4>> ans;

    while (ans.size() < m && !st.empty()) {
        auto [di, i] = *st.begin();
        st.erase(st.begin());

        if (di >= k) {
            ans.push_back({i + 1, k});
            if (di > k) {
                st.emplace(di - k, i);
            }
            continue;
        }

        if (st.empty()) {
            break;
        }

        auto [dj, j] = *st.rbegin();
        st.erase(prev(st.end()));

        if (di + dj < k) {
            break;
        }

        ans.push_back({i + 1, di, j + 1, k - di});

        dj -= k - di;
        if (dj > 0) {
            st.emplace(dj, j);
        }
    }

    assert(ans.size() == m);
    return ans;
}

constexpr int X = 1e6 + 7;

bitset<X * 2 + 1> B;
int par[X * 2 + 1];

void solve() {
    int n, m, k;
    cin >> n >> m >> k;

    vector<int> a(n), b(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        b[i] = k - a[i];
    }

    vector<array<int, 4>> ans;

    if (m != n - 2) {
        vector<int> ord(n);
        iota(ord.begin(), ord.end(), 0);
        ans = easy(m, k, ord, a);
    } else {
        B.reset();
        B[X] = true;

        vector<int> o(n);
        iota(o.begin(), o.end(), 0);
        mt19937 rnd(1337);
        shuffle(o.begin(), o.end(), rnd);

        int mn = 0, mx = 0;

        for (int i : o) {
            auto nw = B;
            if (b[i] >= 0) {
                B |= B << b[i];
            } else {
                B |= B >> (-b[i]);
            }
            nw ^= B;

            for (int t = nw._Find_first(); t < nw.size(); t = nw._Find_next(t)) {
                par[t] = i;
            }
        }

        vector<int> type(n, 1);
        bool yay = false;

        if (B[X + k]) {
            int x = k;
            while (x != 0) {
                int i = par[X + x];
                type[i] = 0;
                x -= b[i];
            }

            yay = true;
        }

        if (!yay) {
            cout << "-1\n";
            return;
        }

        for (int t = 0; t < 2; ++t) {
            vector<int> ord;
            int s = 0;

            for (int i = 0; i < n; ++i) {
                if (type[i] == t) {
                    s += a[i];
                    ord.push_back(i);
                }
            }

            auto now = easy(s / k, k, ord, a);
            ans.insert(ans.end(), now.begin(), now.end());
        }
    }

    if (ans.size() != m) {
        cout << "-1\n";
    } else {
        for (auto [i, di, j, dj] : ans) {
            cout << i << " " << di;
            if (j > 0) {
                cout << " " << j << " " << dj;
            }
            cout << '\n';
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

#ifdef __APPLE__
    freopen("dish.in", "r", stdin);
    freopen("dish.out", "w", stdout);
#endif

    int test = 1;
    cin >> test;

    while (test--) {
        solve();
    }

    return 0;
}