#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e5;

typedef pair<int, int> pii;

map<int, int> pos;
map<int, vector<pii>> edges;
vector<pii> matching;
bool found[MAXN];

int match(int cur) {
	while (pos[cur] < edges[cur].size()) {
		if (found[edges[cur][pos[cur]].second]) {
			pos[cur]++;
			continue;
		}
		int unmatched = edges[cur][pos[cur]].second;
		found[unmatched] = 1;
		int nxt = edges[cur][pos[cur]].first;
		pos[cur]++;
		int v = match(nxt);
		if (v != -1) {
			matching.push_back(pii(v, unmatched));
			unmatched = -1;
		}
		v = match(cur);
		if (v != -1) {
			if (unmatched == -1) unmatched = v;
			else {
				matching.push_back(pii(v, unmatched));
				unmatched = -1;
			}
		}
		return unmatched;
	}
	return -1;
}

void solve() {
	int n; cin >> n;
	pos.clear();
	edges.clear();
	matching.clear();
	fill(found, found+n, 0);
	for (int i = 0; i < n; i++) {
		int x; cin >> x;
		edges[2*(x+i)].push_back(pii(2*(x-i)+1, i));
		edges[2*(x-i)+1].push_back(pii(2*(x+i), i));
	}
	for (auto it: edges) pos[it.first] = 0;
	for (auto it: edges) match(it.first);
	assert(2*matching.size() <= n);
	if (2*matching.size() < n) cout << "No\n";
	else {
		cout << "Yes\n";
		for (pii p: matching) cout << p.first+1 << ' ' << p.second+1 << '\n';
	}
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	int t; cin >> t;
	while (t--) solve();
}