#pragma GCC optimize("Ofast")
#include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
template <class T> using Arr = std::vector<T>;

struct edge_t {
	int to, id;
};

const int MAXN = 100002;
int n, a[MAXN];
Arr<edge_t> e[MAXN * 2], tr[MAXN * 2];
int vis[MAXN * 2], fa[MAXN * 2], sz[MAXN * 2], out[MAXN * 2];

void add(int u, int v, int w) {
	// printf("add %d %d %d\n", u, v, w);
	e[u].push_back({v, w});
	e[v].push_back({u, w});
}

Arr<std::pair<int, int>> ans;
void connect(int u, int v) {
	ans.push_back({u, v});
}

void dfs(int p) {
	sz[p] = 1, vis[p] = true;
	for (auto [to, _] : e[p])
		if (to != fa[p] && !vis[to]) {
			fa[to] = p;
			tr[p].push_back({to, _});
			dfs(to);
			sz[p] += sz[to];
		}

	int tmp = 0, last;
	for (auto [to, id] : tr[p]) {
		if (sz[to] & 1) {
			++tmp;
			if (tmp & 1)
				last = id;
			else
				connect(id, last);
		} else
			connect(id, out[to]);
	}
	if (tmp & 1)
		out[p] = last;
	assert((tmp & 1) != (sz[p] & 1));
}

void Solve() {
	std::cin >> n;
	Arr<int> ls, rs;
	for (int i = 1; i <= n; ++i) {
		std::cin >> a[i];
		ls.push_back(i - a[i]);
		rs.push_back(i + a[i]);
	}
	std::sort(ls.begin(), ls.end());
	ls.erase(std::unique(ls.begin(), ls.end()), ls.end());
	std::sort(rs.begin(), rs.end());
	rs.erase(std::unique(rs.begin(), rs.end()), rs.end());
	int ln = (int)ls.size(), rn = (int)rs.size();
	auto find = [](Arr<int> &v, int x) { return (int)(std::lower_bound(v.begin(), v.end(), x) - v.begin()); };

	for (int i = 0; i < ln + rn; ++i) {
		e[i].clear(), tr[i].clear();
		vis[i] = false;
		fa[i] = -1;
		sz[i] = 0;
		out[i] = -1;
	}

	for (int i = 1; i <= n; ++i) {
		int l = find(ls, i - a[i]);
		int r = find(rs, i + a[i]);
		add(l, ln + r, i);
	}

	ans.clear();
	for (int i = 0; i < ln + rn; ++i)
		if (!vis[i]) {
			dfs(i);
			if (~sz[i] & 1)
				return puts("No"), void();
		}
	// assert(ans.size() == n / 2);
	puts("Yes");
	for (auto [u, v] : ans)
		printf("%d %d\n", u, v);
}

int main() {
	std::ios::sync_with_stdio(false);
	int T;
	std::cin >> T;
	while (T--)
		Solve();
	return 0;
}