#include<bits/stdc++.h>
#define P pair<int,int>
#define fi first
#define se second
#define LL long long
#define fr(x) freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);
using namespace std;
const int N=2e5+5;
int T,n,m,a[N],b[N],sz[N],fa[N];
vector<P>g[N],ans;bool v[N],ban[N];
inline int getf(int x){return fa[x]==x?x:fa[x]=getf(fa[x]);}
inline void hb(int x,int y)
{
	x=getf(x),y=getf(y);sz[x]++;
	if(x^y) fa[y]=x,sz[x]+=sz[y];
}
inline void add(int u,int v,int w)
{
	hb(u,v);//cout<<u<<" "<<v<<" "<<w<<"\n";
	g[u].push_back({v,w}),g[v].push_back({u,w});
}
inline bool chk()
{
	for(int i=1;i<=m;i++) if(sz[getf(i)]&1) return 0;
	return 1;
}
void dfs(int x,int las)
{
	v[x]=1;
	for(auto [y,w]:g[x]) if(!v[y]) dfs(y,w);
	vector<int>nw;
	for(auto [y,w]:g[x]) if(!ban[w]&&w!=las) nw.push_back(w);
	if(nw.size()&1) nw.push_back(las);
	for(int i:nw) ban[i]=1;
	for(int i=0;i<nw.size()/2;i++) ans.push_back({nw[i<<1],nw[i<<1|1]});
}
int main()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);cin>>T;
	while(T--)
	{
		cin>>n;m=0;ans.clear();
		for(int i=1;i<=n;i++) cin>>a[i],b[++m]=i-a[i],b[++m]=i+a[i],ban[i]=0;
		sort(b+1,b+1+m);m=unique(b+1,b+1+m)-b-1;
		for(int i=1;i<=m;i++) fa[i]=i,sz[i]=0,g[i].clear(),v[i]=0;
		#define ls(x) lower_bound(b+1,b+1+m,x)-b
		for(int i=1;i<=n;i++) add(ls(i-a[i]),ls(i+a[i]),i);
		if(!chk()){cout<<"No\n";continue;}
		for(int i=1;i<=m;i++) if(!v[i]) dfs(i,0);
		cout<<"Yes\n";
		for(auto [u,v]:ans) cout<<u<<" "<<v<<"\n";
	}
	return 0;
}