#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rof(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const int Maxn=2e5;

int n,m,a[Maxn+5],dfn[Maxn+5],idx[Maxn+5],anc[Maxn+5];
int cur,vis[Maxn+5],chk[Maxn+5];
map<int,int> mp1,mp2;
vector<pair<int,int>> v[Maxn+5];
inline void Add(int x,int y,int k)
{v[x].emplace_back(y,k),v[y].emplace_back(x,k);}
inline void dfs(int x,int fa)
{
    vis[x]=1,dfn[x]=++cur,idx[cur]=x,anc[x]=fa;
    for(auto [y,z]:v[x]) if(z!=fa && !vis[y]) dfs(y,z);
}
inline void Clear()
{
    For(i,1,m) dfn[i]=idx[i]=anc[i]=vis[i]=0;
    For(i,1,n) chk[i]=0;
    For(i,1,m) vector<pair<int,int>>().swap(v[i]);
    mp1.clear(),mp2.clear(),cur=m=0;
}
inline void Solve()
{
    cin>>n;
    For(i,1,n) cin>>a[i];
    For(i,1,n)
    {
        if(!mp1.count(a[i]-i)) mp1[a[i]-i]=++m;
        if(!mp2.count(a[i]+i)) mp2[a[i]+i]=++m;
        Add(mp1[a[i]-i],mp2[a[i]+i],i);
    }
    For(i,1,m) if(!dfn[i]) dfs(i,0);
    vector<pair<int,int>> ans;
    Rof(_,m,1)
    {
        int i=idx[_]; vector<int> w;
        for(auto [y,z]:v[i]) if(z!=anc[i] && !chk[z]) w.push_back(z);
        if((w.size()&1) && anc[i] && !chk[anc[i]]) w.push_back(anc[i]);
        if((w.size()&1)) {puts("No"); Clear(); return;}
        int sz=w.size();
        for(auto i:w) chk[i]=1;
        for(int i=1;i<sz;i+=2) ans.emplace_back(w[i-1],w[i]);
    } puts("Yes");
    for(auto [a,b]:ans) printf("%d %d\n",a,b); Clear();
}

int main()
{
    // freopen("1.in","r",stdin);

    int T; cin>>T;
    while(T--) Solve();
    return 0;
}