#include <bits/stdc++.h>
using namespace std;

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FILL(a, b) memset(a, b, sizeof(a))

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

const int N = 1 << 17;

set<int> nused[N][2];
int used[N];
int x[N], y[N];

vector<PII> ans;

int dfs(int v, int par){
	auto& L = nused[x[v]][0];
	auto& R = nused[y[v]][1];
	
	used[v] = 1;
	L.erase(v);
	R.erase(v);
	
	int l = -1;
	if(SZ(L) != 0){
		int to = *L.begin();
		l = dfs(to, v);
	}
	
	int r = -1;
	if(SZ(R) != 0){
		int to = *R.begin();
		r = dfs(to, v);
	}
	if(l == -1 && r == -1)
		return v;

	if(l == -1){
		ans.PB({v, r});
		return -1;
	}
	if(r == -1){
		ans.PB({v, l});
		return -1;
	}
	
	if(par == -1)
		return -1;
	
	if(x[v] == x[par]){
		ans.PB({v, r});		
		return l;
	}
	if(y[v] == y[par]){
		ans.PB({v, l});		
		return r;
	}
		
	
	assert(0);
	return -1;
}

void solve(){
	int n;
	cin >> n;
	
	VI a(n);
	FOR(i, 0, n)
	{
		cin >> a[i];
		x[i] = a[i] - i;
		y[i] = a[i] + i;
	}
	VI v(x, x + n);
	sort(ALL(v));
	FOR (i, 0, n) x[i] = lower_bound(ALL(v), x[i]) - v.begin();
	v = VI(y, y + n);
	sort(ALL(v));
	FOR (i, 0, n) y[i] = lower_bound(ALL(v), y[i]) - v.begin();
	
	FOR(i, 0, n){
		used[i] = 0;
		nused[x[i]][0].insert(i);
		nused[y[i]][1].insert(i);
	}
	FOR(i, 0, n){
		if(used[i])
			continue;
		dfs(i, -1);
	}
	
	if(2 * SZ(ans) != n){
		cout << "No\n";
	}
	else{
		cout << "Yes\n";
		FOR(i, 0, SZ(ans)){
			//assert(x[ans[i].F] == x[ans[i].S] || y[ans[i].F] == y[ans[i].S]);
			 
			cout << ans[i].F + 1 << " " << ans[i].S + 1 << "\n";
		}
	}
	ans.clear();
	FOR(i, 0, n){
		nused[x[i]][0].clear();
		nused[y[i]][1].clear();
		used[i] = 0;
	}
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	int t;
	cin >> t;
	while(t--)
		solve();

	return 0;
}