#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
typedef long long ll;
using namespace std;
constexpr int N=2e5+5;
int a[N],dep[N];
vector<pair<int,int>>G[N];
unordered_map<int,int>id1,id2;
int main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int T;
	cin>>T;
	while(T--)
	{
		int n,idx=0;
		cin>>n,id1.clear(),id2.clear();
		rep(i,1,n)
		{
			cin>>a[i];
			if(!id1[i-a[i]])id1[i-a[i]]=++idx;
			if(!id2[i+a[i]])id2[i+a[i]]=++idx;
			G[id1[i-a[i]]].emplace_back(id2[i+a[i]],i);
			G[id2[i+a[i]]].emplace_back(id1[i-a[i]],i);
		}
		vector<pair<int,int>>ans;
		auto dfs=[&](int x,int fa,auto dfs)->int
		{
			vector<int>edges;
			dep[x]=dep[fa]+1;
			for(auto[y,id]:G[x])
			{
				if(!dep[y])
				{
					int w=dfs(y,x,dfs);
					if(w)ans.emplace_back(id,w);
					else edges.emplace_back(id);
				}
				else if(dep[y]>dep[x])edges.emplace_back(id);
			}
			int pm=(int)edges.size()>>1;
			rep(i,0,pm-1)ans.emplace_back(edges[i<<1],edges[i<<1|1]);
			return (int)edges.size()&1?edges[pm<<1]:0;
		};
		rep(i,1,idx)if(!dep[i])dfs(i,0,dfs);
		if(ans.size()==(n>>1))
		{
			cout<<"Yes\n";
			for(auto[x,y]:ans)cout<<x<<' '<<y<<'\n';
		}
		else cout<<"No\n";
		rep(i,1,1000)dep[i]=0,G[i].clear();
	}
	return 0;
}