#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;

void solve() {
    int n; cin >> n;
    vector<int>a(n + 1);
    vector<int>v;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        v.push_back(i - a[i]);
        v.push_back(i + a[i]);
    }

    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    int m = v.size() + 5;

    vector<vector<int>>h(m + 1);
    vector<array<int, 2>>e;
    vector<int>vis(m + 1), hav(m + 1, -1), pp(m * 4 + 10,1);

    auto add = [&](int a, int b) {
        h[a].push_back(e.size());
        e.push_back({a, b});
    };

    for (int i = 1; i <= n; i++) {
        int x = lower_bound(v.begin(), v.end(), i - a[i]) - v.begin() + 1;
        int y = lower_bound(v.begin(), v.end(), i + a[i]) - v.begin() + 1;
        add(x, y);
        add(y, x);
    }
    vector<array<int, 2>>ans;
    auto dfs = [&](auto && ff, int u, int lst)->void{
        vis[u] = 1;
        for (int i : h[u]) {
            int v = e[i][1];
            int ok = pp[i];
            pp[i] = pp[i ^ 1] = 0;
            if (ok) {
                if (!vis[v] and i != (lst ^ 1)) {
                    ff(ff, v, 0);
                }
                if (hav[v] != -1) {
                    ans.push_back({hav[v], i / 2 + 1});
                    hav[v] = -1;
                } else if (hav[u] != -1) {
                    ans.push_back({hav[u], i / 2 + 1});
                    hav[u] = -1;
                } else {
                    hav[u] = i / 2 + 1;
                }
            }
        }
    };
    for (int i = 1; i <= v.size(); i++) {
        if (!vis[i])dfs(dfs, i, -1);
    }
    // cout<<ans.size()<<"\n";
    if ((int)ans.size() == 0 || (int)ans.size()*2!=n) {
        cout << "No\n";
        return;
    }
    cout << "Yes\n";
    for (auto [u, v] : ans) {
        cout << u << " " << v << "\n";
    }
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int tt = 1;
    cin >> tt;
    while (tt--)
        solve();
    return 0;
}