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

void debug(const char *msg, ...) {
#ifdef CLESIP
    va_list arg;
    static char pbString[512];
    va_start(arg,msg);
    vsprintf(pbString,msg,arg);
    cerr << "[DEBUG] " << pbString << "\n";
    va_end(arg);
#endif    
}

#define PASSED debug("PASSED (%s) LINE #%s", __FUNCTION__, __LINE__)

using i64 = long long;
using i128 = __int128_t;
template <typename T, typename L> void chkmax(T &x, L y) { if (x < y) x = y; }
template <typename T, typename L> void chkmin(T &x, L y) { if (x > y) x = y; }

const int N = 1e5 + 10;
int n, a[N], b[N * 2], cnt, tot, bel[N];
bool vis[N * 2], used[N];
bool GG;
vector<pair<int, int>> G[N * 2], ans;

void dfs(int x, int fa) {
	vis[x] = true;
	for (auto [y, _] : G[x]) if (!vis[y])
		dfs(y, x);
	vector<int> avail;
	for (auto [y, id] : G[x]) if (!used[id] && y != fa)
		avail.push_back(id);
	
	if (avail.size() % 2) {
		if (fa == 0) {
			GG = true;
			return;
		}
		for (auto [y, id] : G[x]) if (y == fa)
			avail.push_back(id);
	}
	for (int i = 0; i < (int) avail.size(); i += 2) {
		int u = avail[i], v = avail[i + 1];
		used[u] = used[v] = true;
		ans.push_back({ bel[u], bel[v] });
	}
}

void solve() {
	// debug("run new solve");
	GG = false;
	tot = cnt = 0;
	ans.clear();

	cin >> n;
	for (int i = 1; i <= n; i ++) {
		cin >> a[i];
		b[++ cnt] = a[i] - i, b[++ cnt] = a[i] + i;
	}
	sort(b + 1, b + 1 + cnt);
	cnt = unique(b + 1, b + 1 + cnt) - b - 1;
	for (int i = 1; i <= 2 * cnt; i ++)
		G[i].clear(), vis[i] = false;
	for (int i = 1; i <= n; i ++) {
		int x = lower_bound(b + 1, b + 1 + cnt, a[i] - i) - b;
		int y = lower_bound(b + 1, b + 1 + cnt, a[i] + i) - b + cnt;
		// debug("x: %d y: %d", x, y);
		used[++ tot] = false, bel[tot] = i;
		G[x].emplace_back(y, tot);
		G[y].emplace_back(x, tot);
	}
	for (int i = 1; i <= cnt; i ++) if (!vis[i] && !GG) {
		dfs(i, 0);
	}
	if (GG) {
		cout << "No\n";
	} else {
		cout << "Yes\n";
		for (auto [x, y] : ans)
			cout << x << " " << y << "\n";
	}
}

signed main() {
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	int tt; cin >> tt;
	while (tt --)
		solve();
	return 0;
}