/**
 *    author:  longvu
 *    created: 09/25/24 11:09:40
**/
#include<bits/stdc++.h>

using namespace std;

#define int long long
#define sz(x) ((int)x.size())
#define all(x) (x).begin(), (x).end()
const int INF = numeric_limits<int>::max();
const int nax = (int)(2010001);
const int mod = 1e9 + 7;

template<class X, class Y>
bool maximize(X& x, const Y y) {
    if (y > x) {x = y; return true;}
    return false;
}
template<class X, class Y>
bool minimize(X& x, const Y y) {
    if (y < x) {x = y; return true;}
    return false;
}

#define Fi first
#define Se second

int a[nax], vis[nax], dp[nax];
vector<pair<int, int>> adj[nax];
int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int tt;
    cin >> tt;
    while (tt--) {
        int n;
        cin >> n;
        for (int i = 1; i <= 2 * n; ++i) {
            adj[i].clear();
            dp[i] = -1;
            vis[i] = 0;
        }
        vector<int> valuex = { -INF}, valuey = { -INF};
        for (int i = 1; i <= n; ++i) {
            cin >> a[i];
            valuex.push_back(i - a[i]);
            valuey.push_back(i + a[i]);
        }
        sort(all(valuex));
        valuex.resize(unique(all(valuex)) - valuex.begin());
        sort(all(valuey));
        valuey.resize(unique(all(valuey)) - valuey.begin());
        for (int i = 1; i <= n; ++i) {
            int u = lower_bound(all(valuex), i - a[i]) - valuex.begin()
                    , v = lower_bound(all(valuey), i + a[i]) - valuey.begin();
            // cout << u << " " << n + v << " " << i << '\n';
            adj[u].push_back({n + v, i});
            adj[n + v].push_back({u, i});
        }
        vector<pair<int, int>> ans;
        function<void(int)> dfs = [&](int u) {
            vector<int> memo;
            while (!adj[u].empty()) {
                pair<int, int> v = adj[u].back();
                adj[u].pop_back();
                if (!vis[v.Se]) {
                    vis[v.Se] = 1;
                    dfs(v.Fi);
                    if (dp[v.Fi] == -1) {
                        memo.push_back(v.Se);
                    } else {
                        ans.push_back({v.Se, dp[v.Fi]});
                    }
                }
            }
            for (int i = 0; i + 1 < sz(memo); i += 2) {
                ans.push_back({memo[i], memo[i + 1]});
            }
            if (sz(memo) % 2) {
                dp[u] = memo.back();
            }
        };
        for (int i = 1; i <= 2 * n; ++i) {
            if (!vis[i]) {
                dfs(i);
            }
        }
        if (sz(ans) != n / 2) {
            cout << "No" << '\n';
            continue;
        }
        cout << "Yes" << '\n';
        for (auto [u, v] : ans) {
            cout << u << " " << v << '\n';
        }
    }
    return 0;
}