#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 10;
int n, A[N]; vector<pair<int, int>> G[N];
vector<int> lsh; vector<pair<int, int>> ans;

bool vis[N], used[N];
bool dfs(int u, int fa) { vis[u] = true;
    vector<int> E; int flag = 0;
    for(auto &v : G[u]) {
        if(v.second == fa) continue;
        if(v.first != u) {
            if(vis[v.first]) continue;
            dfs(v.first, v.second);
            if(!used[v.second]) E.emplace_back(v.second);
        } else flag = v.second;
    }
    if(flag) E.emplace_back(flag);
    if((int)E.size() % 2 == 1) {
        if(fa == -1) return false;
        else E.emplace_back(fa);
    }
    for(int i = 0; i < E.size(); i += 2)
        ans.push_back({E[i], E[i + 1]}), used[E[i]] = true, used[E[i + 1]] = true;
    return true;
}

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;
        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]) flag = flag && dfs(i, -1);
    if(flag) {
        cout << "Yes\n";
        for(auto &pr : ans) cout << pr.first << ' ' << pr.second << '\n';
    } else cout << "No\n";

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

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

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

    return 0;
}