#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

template <typename T, class F = less<T>>
struct Discrete {
    vector<T> a;
    Discrete(const vector<T> &v) : a(v) {
        sort(a.begin(), a.end(), F());
        a.erase(unique(a.begin(), a.end()), a.end());
    }
    int size() { return a.size(); }
    int operator()(T x) { return lower_bound(a.begin(), a.end(), x, F()) - a.begin(); }
    T operator[](int i) { return a[i]; }
};

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    int t;
    cin >> t;

    auto solve = [&]() {
        int n;
        cin >> n;

        vector<int> a(n), x(n), y(n);

        for (int i = 0; i < n; i++) {
            cin >> a[i];
            x[i] = i - a[i];
            y[i] = i + a[i];
        }

        Discrete dx(x), dy(y);

        vector<vector<pair<int, int>>> g(2 * n);

        for (int i = 0; i < n; i++) {
            x[i] = dx(x[i]), y[i] = dy(y[i]);
            g[x[i]].emplace_back(y[i] + n, i);
            g[y[i] + n].emplace_back(x[i], i);
        }

        vector<int> vis(2 * n), dep(2 * n);
        vector<pair<int, int>> ans;

        auto dfs = [&](auto dfs, int u, int pv, int pe) -> int {
            dep[u] = pv == -1 ? 0 : dep[pv] + 1;
            vis[u] = true;
            vector<int> e;
            for (auto [v, i] : g[u]) {
                if (v == pv) {
                    continue;
                }
                if (vis[v] && dep[v] < dep[u]) {
                    e.push_back(i);
                }
                if (!vis[v] && dfs(dfs, v, u, i)) {
                    e.push_back(i);
                }
            }
            while (int(e.size()) >= 2) {
                ans.emplace_back(e.back(), e.end()[-2]);
                e.pop_back();
                e.pop_back();
            }
            if (!e.empty() && pe != -1) {
                ans.emplace_back(e[0], pe);
                return false;
            } else {
                return true;
            }
        };

        for (int i = 0; i < n; i++) {
            if (!vis[i]) {
                dfs(dfs, i, -1, -1);
            }
        }

        if (int(ans.size()) != n / 2) {
            cout << "No\n";
        } else {
            cout << "Yes\n";
            for (auto [x, y] : ans) {
                cout << x + 1 << ' ' << y + 1 << '\n';
            }
        }
    };
    
    while (t--) {
        solve();
    }
    
    return 0;
}