//#pragma GCC optimize("Ofast", "unroll-loops")
//#pragma GCC target("sse", "sse2", "sse3", "ssse3", "sse4")

#ifdef __APPLE__

#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstdint>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <random>
#include <deque>
#include <functional>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <complex>
#include <numeric>
#include <cassert>
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <thread>

#else
#include <bits/stdc++.h>
#endif

#define all(a) a.begin(),a.end()
#define len(a) (int)(a.size())
#define mp make_pair
#define pb push_back
#define fir first
#define sec second
#define fi first
#define se second

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;

template<typename T>
bool umin(T &a, T b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<typename T>
bool umax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

#if __APPLE__
#define D for (bool _FLAG = true; _FLAG; _FLAG = false)
#define LOG(...) print(#__VA_ARGS__" ::", __VA_ARGS__) << endl

template<class ...Ts>
auto &print(Ts ...ts) { return ((cerr << ts << " "), ...); }

#else
#define D while (false)
#define LOG(...)
#endif

const int max_n = 1e5 + 42, inf = 1000111222;

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

vector<pair<int, int> > g[max_n * 2];

int h[max_n * 2];

bool used[max_n];

vector<pair<int, int> > ans;

void dfs(int v, int par, int par_edg) {
    for(auto& to : g[v])
        if(h[to.fi] == -1) {
            h[to.fi] = h[v] + 1;
            dfs(to.fi, to.fi, to.se);
        }
    vector<int> edges;
    for(auto& to : g[v])
        if(!used[to.se] && h[to.fi] > h[v])
            edges.pb(to.se);
    if(len(edges) % 2 && par_edg != -1) edges.pb(par_edg);
    for(int i = 1; i < len(edges); i += 2) {
        used[edges[i]] = used[edges[i - 1]] = true;
        ans.pb({edges[i], edges[i - 1]});
    }
}

void solve() {
    ans.clear();
    int n;
    cin >> n;
    vector<int> a(n);
    vector<int> bs, cs;
    for(int i = 0; i < n; i++) {
        cin >> a[i];
        bs.pb(a[i] - i);
        cs.pb(a[i] + i);
    }
    sort(all(bs));
    sort(all(cs));
    bs.resize(unique(all(bs)) - bs.begin());
    cs.resize(unique(all(cs)) - cs.begin());
    for(int i = 0; i < n; i++) {
        int b_ind = lower_bound(all(bs), a[i] - i) - bs.begin();
        int c_ind = lower_bound(all(cs), a[i] + i) - cs.begin();
        g[b_ind].pb({len(bs) + c_ind, i});
        g[len(bs) + c_ind].pb({b_ind, i});
    }
    for(int v = 0; v < len(bs) + len(cs); v++) {
        if(h[v] != -1) continue;
        dfs(v, -1, -1);
    }
    if(len(ans) != n / 2) cout << "No\n";
    else {
        cout << "Yes\n";
        for(auto& x : ans) cout << x.fi + 1 << ' ' << x.se + 1 << '\n';
    }
    for(int i = 0; i < n; i++) used[i] = false;
    for(int i = 0; i < len(bs) + len(cs); i++) { g[i].clear(); h[i] = -1; }
}

signed main() {
//   freopen("input.txt", "r", stdin);
//   freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    for(int i = 0; i < max_n * 2; i++) h[i] = -1;

    int t = 1;

    cin >> t;

    while (t--) solve();

}

/*
KIVI
*/