#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


int M;
vector<Int> Y;

int N;
vector<int> A, B;

vector<vector<int>> G;
vector<int> vis;
vector<int> used;
vector<pair<int, int>> ans;

int dfs(int u, int pi) {
  vis[u] = 1;
  int ret = -1;
  for (const int i : G[u]) if (!used[i]) {
    used[i] = 1;
    const int v = A[i] ^ B[i] ^ u;
    int res = -1;
    if (!vis[v]) {
      res = dfs(v, i);
    }
    if (~res) {
      ans.emplace_back(i, res);
    } else {
      if (~ret) {
        ans.emplace_back(ret, i);
        ret = -1;
      } else {
        ret = i;
      }
    }
  }
  return ret;
}

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d", &M);
    Y.resize(M);
    for (int i = 0; i < M; ++i) {
      scanf("%lld", &Y[i]);
    }
    
    vector<Int> ps(M), qs(M);
    for (int i = 0; i < M; ++i) {
      ps[i] = Y[i] + i;
      qs[i] = Y[i] - i;
    }
    sort(ps.begin(), ps.end());
    sort(qs.begin(), qs.end());
    ps.erase(unique(ps.begin(), ps.end()), ps.end());
    qs.erase(unique(qs.begin(), qs.end()), qs.end());
    const int psLen = ps.size();
    const int qsLen = qs.size();
    N = psLen + qsLen;
    A.resize(M);
    B.resize(M);
    for (int i = 0; i < M; ++i) {
      A[i] = lower_bound(ps.begin(), ps.end(), Y[i] + i) - ps.begin();
      B[i] = lower_bound(qs.begin(), qs.end(), Y[i] - i) - qs.begin();
      B[i] += psLen;
    }
// cerr<<"A = "<<A<<", B = "<<B<<endl;
    
    G.assign(N, {});
    for (int i = 0; i < M; ++i) {
      G[A[i]].push_back(i);
      G[B[i]].push_back(i);
    }
    vis.assign(N, 0);
    used.assign(M, 0);
    ans.clear();
    for (int u = 0; u < N; ++u) if (!vis[u]) {
      const int res = dfs(u, 0);
      if (~res) {
        goto failed;
      }
    }
    
    puts("Yes");
    for (const auto &p : ans) {
      printf("%d %d\n", p.first + 1, p.second + 1);
    }
    assert(2 * (int)ans.size() == M);
    continue;
   failed:{}
    puts("No");
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}