#include<bits/stdc++.h>
#define file(F) freopen(#F".in","r",stdin),freopen(#F".out","w",stdout)
#define lowbit(x) ((x)&-(x))
#define ALL(x) (x).begin(),(x).end()
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define popcount(x) (__builtin_popcount((x)))
#define abs(x) ((x)>=0?(x):-(x))
using namespace std;
using ll=long long;
using uint=uint32_t;
template<typename T>
inline bool Max(T &x,T y) { return std::less<T>()(x,y)&&(x=y,true); }
template<typename T>
inline bool Min(T &x,T y) { return std::less<T>()(y,x)&&(x=y,true); }
void Solve();
const int N = 2e5+25;
int n;
int a[N];
vector<int> VL,VR;
vector<pair<int,int>> e[N];
int dep[N];
vector<pair<int,int>> G;
int dfs(int u,int fa) {
   dep[u]=dep[fa]+1;
   vector<int> es;
   for(auto [v,id]:e[u]) if(!dep[v]) {
      auto p=dfs(v,u);
      if(p) G.emplace_back(id,p);
      else es.emplace_back(id);
   }
   for(int i=0;i+1<es.size();i+=2)
      G.emplace_back(es[i],es[i+1]);
   return (es.size()&1)?es.back():0;
}
signed main() {
#ifndef ONLINE_JUDGE
#endif
   cin.tie(nullptr)->sync_with_stdio(false);
   int T; cin>>T; while(T--)
   Solve();
}
void Solve() {
   VL.clear(),VR.clear(),G.clear();
   for(int i=1;i<=n+n;i++) e[i].clear(),dep[i]=0;
   cin>>n;
   for(int i=1;i<=n;i++) {
      cin>>a[i];
      VL.emplace_back(i-a[i]);
      VR.emplace_back(i+a[i]);
   }
   sort(ALL(VL)),VL.erase(unique(ALL(VL)),VL.end());
   sort(ALL(VR)),VR.erase(unique(ALL(VR)),VR.end());
   for(int i=1;i<=n;i++) {
      int l=upper_bound(ALL(VL),i-a[i])-VL.begin();
      int r=upper_bound(ALL(VR),i+a[i])-VR.begin()+n;
      e[l].emplace_back(r,i);
      e[r].emplace_back(l,i);
   }
   for(int i=1;i<=n+n;i++) if(!dep[i]&&dfs(i,0)) 
      return void(puts("No"));
   puts("Yes");
   assert(G.size()==n/2);
   for(auto [u,v]:G) printf("%d %d\n",u,v);
}