//μ's forever
#include <bits/stdc++.h>
#define N 200005
//#define getchar nc
using namespace std;
inline char nc(){
    static char buf[100000],*p1=buf,*p2=buf;
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline int read()
{
    register int x=0,f=1;register char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
    return x*f;
}
inline void write(register int x)
{
    if(!x)putchar('0');if(x<0)x=-x,putchar('-');
    static int sta[20];register int tot=0;
    while(x)sta[tot++]=x%10,x/=10;
    while(tot)putchar(sta[--tot]+48);
}
int T,n,a[N];
struct edge{
    int to,nxt,w;
}e[N<<1];
int head[N],cnt;
void add(int u,int v,int w){
    e[++cnt]=(edge){v,head[u],w},head[u]=cnt;
    e[++cnt]=(edge){u,head[v],w},head[v]=cnt;
}
map<int,int> mp1,mp2;
int cntn;
int visn[N],vis[N];
vector<pair<int,int> >ans;
bool fl;
void dfs(int x,int f){
    vis[x]=1;
    for(int i=head[x];i&&fl==0;i=e[i].nxt){
        int v=e[i].to;
        if(!vis[v]) dfs(v,x);
    }
    if(fl) return;
    vector<int> tmp;
    int val=0;
    for(int i=head[x];i;i=e[i].nxt){
        int v=e[i].to;
        if(!visn[e[i].w]&&v!=f) tmp.push_back(e[i].w);
        if(v==f) val=e[i].w;
    }
    if(tmp.size()%2==1){
        if(f==0){
            fl=1;
            return;
        }
        tmp.push_back(val);
    }
    for(int i=0;i<tmp.size();i+=2){
        visn[tmp[i]]=visn[tmp[i+1]]=1;
        ans.push_back(make_pair(tmp[i],tmp[i+1]));
    }
}
int main()
{
    T=read();
    while(T--){
        n=read();
        for(int i=1;i<=n*2;++i) head[i]=visn[i]=vis[i]=0;
        cnt=0;
        mp1.clear(),mp2.clear();
        cntn=0;
        fl=0;
        ans.clear();
        for(int i=1;i<=n;++i){
            a[i]=read();
            if(!mp1[i-a[i]]) mp1[i-a[i]]=++cntn;
            if(!mp2[i+a[i]]) mp2[i+a[i]]=++cntn;
            add(mp1[i-a[i]],mp2[i+a[i]],i);
        }
        for(int i=1;i<=cntn;++i)
            if(!vis[i])
                dfs(i,0);
        if(fl) puts("No");
        else{
            puts("Yes");
            for(int i=0;i<n/2;++i)
                printf("%d %d\n",ans[i].first,ans[i].second);
        }
    }
    return 0;
}