#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
template <typename T> inline void read(T &F) {
    int R = 1; F = 0; char CH = getchar();
    for(; !isdigit(CH); CH = getchar()) if(CH == '-') R = -1;
    for(; isdigit(CH); CH = getchar()) F = F * 10 + CH - 48;
    F *= R;
}
inline void file(string str) {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
}
const int N = 5e5 + 10;
vector<pair<int, int> > edge[N], R; int n, vis[N], flag[N], f[N];
void dfs(int x) {
    //cout << x << endl;
    vis[x] = 1;
    for(auto i : edge[x]) {
        if(vis[i.first]) continue;
        f[i.first] = i.second; dfs(i.first);
    }
}
void calc(int x) { 
    for(auto i : edge[x])
        if(f[i.first] == i.second) calc(i.first);
    for(auto &i : edge[x])
        if(i.second == f[x]) swap(i, edge[x].back());
    int l = 0;
    for(auto i : edge[x]) {
        if(flag[i.second]) continue;
        if(l) R.emplace_back(l, i.second), flag[l] = flag[i.second] = 1, l = 0;
        else l = i.second;
    }
}
int main() {
    //file("");
    int T; read(T);
    while(T--) {
        read(n); R.clear();
        for(int i = 1; i <= n * 4; i++) vis[i] = flag[i] = f[i] = 0, edge[i].clear();
        map<int, int> M; int tot = 0;
        for(int i = 1; i <= n; i++) {
            int v; read(v);
            const int x = i - v, y = n + v + i;
            if(!M[x]) M[x] = ++tot;
            if(!M[y]) M[y] = ++tot;
            edge[M[x]].emplace_back(M[y], i);
            edge[M[y]].emplace_back(M[x], i);
        }
        int ans = 1;
        for(int i = 1; i <= tot && ans; i++)
            if(!vis[i]) {
                dfs(i), calc(i);
                for(auto j : edge[i])
                    if(!flag[j.second]) ans = 0;
            }
        if(!ans) {
            puts("No"); continue;
        }
        puts("Yes");
        for(auto i : R) cout << i.first << ' ' << i.second << '\n';
    }
    
    #ifdef _MagicDuck
        fprintf(stderr, "# Time: %.3lf s", (double)clock() / CLOCKS_PER_SEC);
    #endif
    return 0;
}