#include<bits/stdc++.h>
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
const int N=200005;
int _,n,m,a[N],dep[N],cnt;
vector<pii>e[N];
map<int,int>mp1,mp2;
pii ans[N];
int dfs(int u,int fa)
{
	vector<int>nw;
	dep[u]=dep[fa]+1;
	for(int i=0;i<e[u].size();i++)
	{
		int v=e[u][i].fi,id=e[u][i].se;
		if(v==fa) continue;
		if(dep[v])
		{
			if(dep[v]>dep[u]) nw.pb(id);
			continue;
		}
		int p=dfs(v,u);
		if(p) ans[++m]={p,id};
		else nw.pb(id);
	}
	int res=0;
	if(nw.size()%2==1) res=nw.back(),nw.pop_back();
	for(int i=0;i<nw.size();i+=2) ans[++m]={nw[i],nw[i+1]};
	return res;
}
void solve()
{
	m=0;
	mp1.clear();
	mp2.clear();
	cin>>n;
	for(int i=1;i<=n;i++) cin>>a[i],mp1[a[i]-i]=1,mp2[a[i]+i]=1;
	cnt=0;
	for(auto u:mp1) mp1[u.fi]=++cnt;
	for(auto u:mp2) mp2[u.fi]=++cnt;
	for(int i=1;i<=cnt;i++) e[i].clear(),dep[i]=0;
	for(int i=1;i<=n;i++)
	{
		int x=mp1[a[i]-i],y=mp2[a[i]+i];
		e[x].pb({y,i});
		e[y].pb({x,i});
	}
	for(int i=1;i<=cnt;i++)
	{
		if(dep[i]) continue;
		if(dfs(i,0))
		{
			cout<<"No"<<'\n';
			return;
		}
	}
	cout<<"Yes"<<'\n';
	for(int i=1;i<=m;i++) cout<<ans[i].fi<<' '<<ans[i].se<<'\n';
	return;
}
int main()
{
	//freopen("matching.in","r",stdin);
	//freopen("matching.out","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>_;
	while(_--) solve();
	return 0;
}