#include <bits/stdc++.h>
#define inf 1000000007
#define mod 1000000007
// #define int long long
// #pragma GCC optimize("Ofast","inline","-ffast-math")
// #pragma GCC target("avx,sse2,sse3,sse4,mmx")
using namespace std;
template <typename T> void read(T &x){
	x=0;char ch=getchar();int fh=1;
	while (ch<'0'||ch>'9'){if (ch=='-')fh=-1;ch=getchar();}
	while (ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
	x*=fh;
}
template <typename T> void write(T x) {
	if (x<0) x=-x,putchar('-');
	if (x>9) write(x/10);
	putchar(x%10+'0');
}
template <typename T> void writeln(T x) {
	write(x);
	puts("");
}
int n,a[100005],ed;
vector<int> numsl,numsr;
vector<pair<int,int>> g[200005];
int vis[200005],match[100005];
void dfs1(int x)
{
	vis[x]=1;
	ed+=g[x].size();
	for(auto i:g[x])
		if(!vis[i.first])
			dfs1(i.first);
}
void dfs2(int x,int fa)
{
	vis[x]=2;
	vector<int> vec;
	int tofa;
	for(auto i:g[x])
		if(i.first==fa) tofa=i.second;
		else if(vis[i.first]!=2) dfs2(i.first,x);
	for(auto i:g[x])
		if(i.first!=fa&&!match[i.second])
			vec.push_back(i.second);
	if(vec.size()&1) vec.push_back(tofa);
	for(int i=0;i<vec.size();i+=2)
		match[vec[i]]=vec[i+1],match[vec[i+1]]=vec[i];
}
signed main()
{
	// freopen("accepts.in","r",stdin);
	// freopen("accepts.out","w",stdout);
	int tc;read(tc);
	while(tc--)
	{
		read(n);
		numsl.clear();
		numsr.clear();
		for(int i=1;i<=n;++i)
		{
			read(a[i]);match[i]=0;
			numsl.push_back(i-a[i]);
			numsr.push_back(i+a[i]);
		}
		sort(numsl.begin(),numsl.end());
		numsl.erase(unique(numsl.begin(),numsl.end()),numsl.end());
		sort(numsr.begin(),numsr.end());
		numsr.erase(unique(numsr.begin(),numsr.end()),numsr.end());
		for(int i=1;i<=numsl.size()+numsr.size();++i)
			g[i].clear(),vis[i]=0;
		for(int i=1;i<=n;++i)
		{
			int x=upper_bound(numsl.begin(),numsl.end(),i-a[i])-numsl.begin();
			int y=upper_bound(numsr.begin(),numsr.end(),i+a[i])-numsr.begin()+numsl.size();
			g[x].push_back({y,i});
			g[y].push_back({x,i});
		}
		bool flag=1;
		for(int i=1;i<=numsl.size()+numsr.size();++i)
			if(!vis[i])
			{
				ed=0;dfs1(i);ed/=2;
				if(ed&1)
				{
					flag=0;break;
				}
				dfs2(i,0);
			}
		if(!flag) puts("No");
		else
		{
			puts("Yes");
			for(int i=1;i<=n;++i) vis[i]=0;
			for(int i=1;i<=n;++i)
				if(!vis[i]) write(i),putchar(' '),writeln(match[i]),vis[i]=vis[match[i]]=1;
		}
	}
	return 0;
}