#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 10, M = 2e5 + 10;
int n, A[N], h[N], e[M], ne[M], idx;
inline void add(int a, int b) {e[idx] = b, ne[idx] = h[a], h[a] = idx ++; }
inline void add(int a, int b, bool flag) {add(a, b), add(b, a); }
vector<int> lsh;

vector<pair<int, int>> ans;
bool vis[N], used[M];
bool dfs(int u, int fa) { vis[u] = true;
    vector<int> E;
    for(int i = h[u]; i != -1; i = ne[i]) {
        int v = e[i]; if(vis[v] || (i ^ 1) == fa) continue;
        dfs(v, i); if(!used[i]) used[i] = used[i ^ 1] = true, E.emplace_back(i / 2 + 1);
    }

    if((int)E.size() % 2 == 1 && fa == -1) return false;
    if((int)E.size() % 2 == 1) used[fa] = used[fa ^ 1] = true, E.emplace_back(fa / 2 + 1);
    for(int i = 0; i < E.size(); i += 2) ans.push_back({E[i], E[i + 1]});
    return true;
}

int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    memset(h, -1, sizeof h);

    int T; cin >> T;
    while(T --) {
        cin >> n; memset(h + 1, -1, sizeof(int) * (2 * n)), idx = 0;
        lsh.clear(), ans.clear();
        memset(used + 1, false, sizeof(bool) * (2 * n)), memset(vis + 1, false, sizeof(bool) * (2 * n));

        for(int i = 1; i <= n; i ++) cin >> A[i];
        for(int i = 1; i <= n; i ++) lsh.emplace_back(i - A[i]), lsh.emplace_back(i + A[i]);
        sort(lsh.begin(), lsh.end()), lsh.erase(unique(lsh.begin(), lsh.end()), lsh.end());

        for(int i = 1; i <= n; i ++) 
            add(lower_bound(lsh.begin(), lsh.end(), i - A[i]) - lsh.begin() + 1, lower_bound(lsh.begin(), lsh.end(), i + A[i]) - lsh.begin() + 1, true);

        bool flag = true;
        for(int i = 1; i <= lsh.size(); i ++) 
            if(!vis[i]) flag = flag && dfs(i, -1);
        if(flag) {
            cout << "Yes\n";
            for(auto &pr : ans) cout << pr.first << ' ' << pr.second << '\n';
        } else cout << "No\n";
    }

    return 0;
}