#include<bits/stdc++.h>
using namespace std;
#define IOS {cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);}
#define rep(i,j,k) for(int i=j;i<=k;++i)
#define per(i,j,k) for(int i=j;i>=k;--i)
#define P pair<int,int>
#define ll long long
#define vi vector<int>
const int N=2e5+5;
P ans[N]; int top=0;
vector<P>tu[N];
unordered_map<int,int>mp1,mp2;
int dep[N];
int dfs(int now,int pre){
    dep[now]=dep[pre]+1;
    vi q;
    for(auto [son,id]:tu[now]){
        if(son==pre)continue;
        if(dep[son]){
            if(dep[son]>dep[now])q.push_back(id);
            continue;
        }
        int res=dfs(son,now);
        if(res)ans[++top]={id,res};
        else q.push_back(id);
    }
    int res=0;
    if(q.size()&1)res=q.back(),q.pop_back();
    for(int i=0;i<q.size();i+=2){
        ans[++top]={q[i],q[i+1]};
    }
    return res;
}
void slv(){
    mp1.clear(); mp2.clear();
    int n;cin>>n;
    vi a(n+1);
    rep(i,1,n){
        cin>>a[i]; mp1[a[i]-i]=1; mp2[a[i]+i]=1;
    }
    int cnt=0;
    for(auto &[_,v]:mp1)v=++cnt;
    for(auto &[_,v]:mp2)v=++cnt;
    rep(i,1,cnt)tu[i].clear(),dep[i]=0;
    rep(i,1,n){
        int u=mp1[a[i]-i],v=mp2[a[i]+i];
        tu[u].push_back({v,i}); tu[v].push_back({u,i});
    }
    top=0;
    rep(i,1,cnt){
        if(dep[i])continue;
        if(dfs(i,0)){
            cout<<"No\n";return;
        }
    }
    cout<<"Yes\n";
    rep(i,1,top)cout<<ans[i].first<<' '<<ans[i].second<<'\n';
}
signed main(){
    IOS
    int T;cin>>T;
    while(T--)slv();
}