#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define eb emplace_back
const int N=1e6+5;
int T,n,a[N],ds1[N],ds2[N],fa[N],z[N];
vector<pair<int,int>> e[N];vector<int> vc[N];
int find(int u) {return u==fa[u]?u:fa[u]=find(fa[u]);}
bool merge(int u,int v)
{u=find(u);v=find(v);if(u==v) return 0;fa[u]=v;return 1;}
void work(int ds[])
{sort(ds+1,ds+ds[0]+1);ds[0]=unique(ds+1,ds+ds[0]+1)-ds-1;}
int id(int ds[],int x) {return lower_bound(ds+1,ds+ds[0]+1,x)-ds;}
void dfs(int u,int f)
{
    for(auto [v,id]:e[u]) if(v!=f)
    {dfs(v,u);if(z[v]) z[v]^=1,vc[v].eb(id);else z[u]^=1,vc[u].eb(id);}
}
void slv()
{
    scanf("%d",&n);ds1[0]=ds2[0]=0;iota(fa+1,fa+n*2+1,1);fill(z+1,z+n*2+1,0);
    for(int i=1;i<=n*2;++i) e[i].clear(),vc[i].clear();
    for(int i=1;i<=n;++i)  
        scanf("%d",&a[i]),ds1[++ds1[0]]=a[i]+i,ds2[++ds2[0]]=a[i]-i;
    work(ds1);work(ds2);
    for(int i=1,u,v;i<=n;++i)
    {
        u=id(ds1,a[i]+i);v=n+id(ds2,a[i]-i);
        if(merge(u,v)) e[u].eb(v,i),e[v].eb(u,i);else z[u]^=1,vc[u].eb(i);
    }
    for(int i=1;i<=n*2;++i) if(find(i)==i) {dfs(i,0);if(z[i]) {puts("No");return;}}
    puts("Yes");
    for(int i=1,t;i<=n*2;++i)
    {t=0;for(auto j:vc[i]) {if(t) printf("%d %d\n",j,t),t=0;else t=j;}}
}
int main()
{
    scanf("%d",&T);
    while(T--) slv();return 0;
}