// what is matter? never mind.
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
//#define int long long
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

int mod;
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 500005
#define inf 0x3f3f3f3f

int n,a[maxn],bel1[maxn],bel2[maxn],m;
bool ok;
map<int,int>mp;
int ID(int x){
	if(!mp.count(x))return mp[x]=++m;
	return mp[x];
}

vector<pii>e[maxn],res;
int dep[maxn],fe[maxn];
bool dfs(int u,int pa){
	dep[u]=dep[pa]+1;
	vi o;
	for(auto it:e[u]){
		int v=it.fi,i=it.se;
		if(i==fe[u])continue;
		if(!dep[v]){
			fe[v]=i;
			if(dfs(v,u)) o.pb(i);
		}
		else if(dep[v]<dep[u])o.pb(i);
	}
	while(o.size()>=2) res.pb(mkp(o.back(),o[o.size()-2])),o.pop_back(),o.pop_back();
	if(o.size()&1){
		if(!pa)ok=0;
		res.pb(mkp(fe[u],o[0]));
		return 0;
	}
	return 1;
}

void work()
{
	n=read();ok=1;
	For(i,0,n*2)e[i].clear(),dep[i]=fe[i]=0; mp.clear(),res.clear(),m=0;
	For(i,1,n)a[i]=read(),bel1[i]=ID(a[i]+i);
	mp.clear();
	For(i,1,n){
		bel2[i]=ID(a[i]-i);
		e[bel1[i]].pb(mkp(bel2[i],i));
		e[bel2[i]].pb(mkp(bel1[i],i));
	}
	For(i,1,m)if(!dep[i])dfs(i,0);
	if(!ok){puts("No");return;}
	puts("Yes");
	for(auto t:res)cout<<t.fi<<" "<<t.se<<"\n";
}

signed main()
{
	int T=read();
	while(T--)work();
	return 0;
}