#include <bits/stdc++.h>

using namespace std;

const int N = 5e5 + 10;
int n, A[N]; vector<int> E[N]; vector<pair<int, int>> G[N];
vector<int> lsh; vector<pair<int, int>> ans;
bool vis[N], used[N];

int dep[N], fa[N]; vector<int> vec;
void dfs(int u, int Fa) {
    vis[u] = true, fa[u] = Fa, dep[u] = dep[Fa] + 1; vec.emplace_back(u);
    for(auto &v : G[u]) 
        if(!vis[v.first]) dfs(v.first, u);
}

inline void solve() {
    cin >> 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 ++) {
        int a = lower_bound(lsh.begin(), lsh.end(), i - A[i]) - lsh.begin() + 1;
        int b = lower_bound(lsh.begin(), lsh.end(), i + A[i]) - lsh.begin() + 1;
        if(a == b) E[a].emplace_back(i);
        else G[a].push_back({b, i}), G[b].push_back({a, i});
    }

    bool flag = true;
    for(int i = 1; i <= lsh.size(); i ++) if(!vis[i]) {
        vec.clear(); dfs(i, 0); sort(vec.begin(), vec.end(), [](int a, int b) {return dep[a] > dep[b]; });
        for(auto &u : vec) {
            for(auto &v : G[u]) {
                if(v.first == fa[u]) continue;
                if(!used[v.second]) E[u].emplace_back(v.second);
            }
            if((int)E[u].size() % 2 == 1) {
                if(fa[u] == 0) {flag = false; break; }
                else E[u].emplace_back((lsh[u - 1] + lsh[fa[u] - 1]) / 2), assert((lsh[u - 1] + lsh[fa[u] - 1]) % 2 == 0);
            }
            for(int j = 0; j < E[u].size(); j += 2)
                assert((!used[E[u][j]]) && (!used[E[u][j + 1]])), used[E[u][j]] = used[E[u][j + 1]] = true, ans.push_back({E[u][j], E[u][j + 1]});
        }
        if(!flag) break;
    }

    if(flag) {
        cout << "Yes\n";
        for(auto &pr : ans) cout << pr.first << ' ' << pr.second << '\n';
    } else cout << "No\n";

    for(int i = 1; i <= lsh.size(); i ++) vis[i] = false;
    for(int i = 1; i <= n; i ++) used[i] = false;
    for(int i = 1; i <= lsh.size(); i ++) E[i].clear(), G[i].clear();
    lsh.clear(), ans.clear();
}

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

    int T; cin >> T;
    while(T --) solve();

    return 0;
}