#include<bits/stdc++.h>
#define ll long long
#define db double
#define ull unsigned long long
#define pb push_back
#define pii pair<int, int>
#define FR first
#define SE second
using namespace std;
inline int read() {
  int x = 0; bool op = false;
  char c = getchar();
  while(!isdigit(c))op |= (c == '-'), c = getchar();
  while(isdigit(c))x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
  return op ? -x : x;
}
const int N = 2e5 + 10;
int n;
int a[N], vis[N], vm[N];
vector<pii> G[N];
vector<pii> mat;
void dfs(int u, int fid) {
  vector<int> V;
  for(auto t : G[u]) {
    int id = t.FR, v = t.SE;
    if(vis[v]) {if(!vm[id] && id != fid)V.pb(id); continue;}
    vis[v] = true; dfs(v, id);
    if(!vm[id])V.pb(id);
  }
  if((V.size() & 1) && fid)V.pb(fid);
  for(int i = 0; i + 1 < V.size(); i += 2)
    vm[V[i]] = vm[V[i + 1]] = true, mat.pb({V[i], V[i + 1]});
  return ;
}
void solve() {
  n = read();
  for(int i = 1; i <= n; i++)a[i] = read();
  map<int, int> id[2]; int tot = 0;
  for(int i = 1; i <= n; i++) {
    if(!id[0].count(i + a[i]))id[0][i + a[i]] = ++tot;
    if(!id[1].count(i - a[i]))id[1][i - a[i]] = ++tot;
    G[id[0][i + a[i]]].pb({i, id[1][i - a[i]]});
    G[id[1][i - a[i]]].pb({i, id[0][i + a[i]]});
  }
  vector<pii>().swap(mat);
  for(int i = 1; i <= tot; i++)if(!vis[i])vis[i] = true, dfs(i, 0);
  for(int i = 1; i <= tot; i++) {
    vector<pii>().swap(G[i]);
    vis[i] = false;
  }
  for(int i = 1; i <= n; i++)vm[i] = false;
  if(mat.size() != n / 2)return puts("No"), void();
  puts("Yes");
  for(auto t : mat)printf("%d %d\n", t.FR, t.SE);
  return ;
}
int main() {
  int test = read();
  while(test--)solve();
  return 0;
}