#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define x first
#define y second

using namespace std;

typedef long long ll;
typedef long double ld;

int mas[100005];
map <int, int> opa_plus, opa_minus;
int num_plus[100005], num_minus[100005];
vector <pair <int, int> > g[200005];
bool used[200005];
int sz[200005];

set <int> two_times[200005], one_times[200005];

void dfs(int v, int &kol)
{
	used[v] = true;
	kol += sz[v];
	for (const auto &[u, num] : g[v])
		if (!used[u])
			dfs(u, kol);
	return; 	
}

void build_ans(int v, int pr)
{
 	used[v] = true;
 	for (const auto &[u, num] : g[v])
 		if (!used[u])
 			build_ans(u, num);
 	
 	int kol = (int) one_times[v].size() + (int) two_times[v].size();

 	vector <int> spis;
   	for (int x : one_times[v]) spis.pb(x);
   	one_times[v].clear();
   	for (int x : two_times[v])
   	{
   		if (kol % 2 == 0 || x != pr) spis.pb(x);
   		int sec = num_plus[x] ^ num_minus[x] ^ v;
   		two_times[sec].erase(x); 	
   	}
   	two_times[v].clear();
   	if (kol % 2 == 1) one_times[num_plus[pr] ^ num_minus[pr] ^ v].insert(pr);

   	for (int i = 0; i < (int) spis.size(); i += 2) cout << spis[i] << ' ' << spis[i + 1] << '\n';
   	return;
}

int main()
{
 	//freopen("input.txt", "r", stdin);
 	//freopen("output.txt", "w", stdout);
 	ios_base::sync_with_stdio(0); cin.tie(0);

 	int test;
 	cin >> test;
 	for (int rep = 1; rep <= test; rep++)
 	{
 	 	int n;
 	 	cin >> n;
 	 	for (int i = 1; i <= n; i++) cin >> mas[i];

 	 	opa_plus.clear(), opa_minus.clear();

 	 	for (int i = 1; i <= n; i++)
 	 	{
 	 		opa_plus.insert(mp(mas[i] + i, 0));
 	 		opa_minus.insert(mp(mas[i] - i, 0)); 	
 	 	}

 	 	int cnt = 0;
 	 	for (auto &[dd, num] : opa_plus)
 	 		num = ++cnt;
 	 	for (auto &[dd, num] : opa_minus)
 	 		num = ++cnt;

 	 	for (int i = 1; i <= cnt; i++) g[i].clear(), sz[i] = 0, one_times[i].clear(), two_times[i].clear();
 	 	for (int i = 1; i <= n; i++)
 	 	{
 	 	 	num_plus[i] = opa_plus[mas[i] + i];
 	 	 	num_minus[i] = opa_minus[mas[i] - i];
 	 	 	g[num_plus[i]].pb(mp(num_minus[i], i));
 	 	 	g[num_minus[i]].pb(mp(num_plus[i], i));
 	 	 	sz[num_plus[i]]++, sz[num_minus[i]]++;
 	 	 	two_times[num_plus[i]].insert(i);
 	 	 	two_times[num_minus[i]].insert(i);
 	 	}

 	 	bool fl = true;
 	 	for (int i = 1; i <= cnt; i++) used[i] = false;
 	 	for (int i = 1; i <= cnt; i++)
 	 	{
 	 	 	if (!used[i])
 	 	 	{
 	 	 	 	int kol = 0;
 	 	 	 	dfs(i, kol);
 	 	 	 	if (kol / 2 % 2 == 1) fl = false;
 	 	 	}
 	 	}
 	 	if (!fl) {cout << "No\n"; continue;}

 	 	cout << "Yes\n";
 	 	for (int i = 1; i <= cnt; i++) used[i] = false;
 	 	for (int i = 1; i <= cnt; i++)
 	 	{
 	 	 	if (!used[i]) build_ans(i, -1);
 	 	}
 	}

 	return 0;
}