#include <bits/stdc++.h>
using namespace std;
inline char gc() {
  static char buf[100000], *p1 = buf, *p2 = buf;
  return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
             ? EOF
             : *p1++;
}
inline long long read() {
  long long x = 0;
  char ch = getchar();
  bool positive = 1;
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') positive = 0;
  for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
  return positive ? x : -x;
}
inline void write(long long a) {
  if (a < 0) {
    a = -a;
    putchar('-');
  }
  if (a >= 10) write(a / 10);
  putchar('0' + a % 10);
}
inline void writeln(long long a) {
  write(a);
  puts("");
}
inline void wri(long long a) {
  write(a);
  putchar(' ');
}
long long rnd() {
  unsigned long long ans = 0;
  for (int i = (int)(0); i <= (int)(4); i++) ans = ans << 15 ^ rand();
  return ans % ((unsigned long long)1 << 63);
}
const int N = 18, M = 1 << 15 | 2, inf = 1e9;
int dp[M][N][N], h[M][N], n, a[N], s[M], fa[N], bj[N];
int main() {
  int T = read();
  while (T--) {
    n = read();
    for (int i = (int)(0); i <= (int)(n - 1); i++) a[i] = read();
    for (int i = (int)(0); i <= (int)((1 << n) - 1); i++)
      for (int j = (int)(0); j <= (int)(n - 1); j++) {
        h[i][j] = n;
        for (int k = (int)(n - 1); k >= (int)(j); k--)
          if (i >> k & 1) h[i][j] = k;
        if (i >> j & 1) s[i] = s[i ^ (1 << j)] + a[j];
      }
    for (int i = (int)(0); i <= (int)((1 << n) - 1); i++)
      for (int j = (int)(0); j <= (int)(n); j++)
        for (int k = (int)(0); k <= (int)(n); k++) dp[i][j][k] = inf;
    dp[0][0][0] = 0;
    for (int i = (int)(0); i <= (int)((1 << n) - 1); i++) {
      for (int j = (int)(0); j <= (int)(n - 1); j++)
        for (int k = (int)(0); k <= (int)(n - 1); k++)
          if (dp[i][j][k] < inf) {
            int zt = ((1 << n) - 1) ^ i;
            for (int o = zt; o; o = (o - 1) & zt)
              if (s[o] > dp[i][j][k]) {
                dp[i | o][j + 1][h[o][k]] =
                    min(dp[i | o][j + 1][h[o][k]], s[o]);
              }
          }
    }
    int zt = (1 << n) - 1, p, q;
    for (int i = (int)(0); i <= (int)(n); i++)
      for (int j = (int)(0); j <= (int)(n - 1); j++)
        if (dp[zt][i][j] < inf) {
          p = i;
          q = j;
        }
    writeln(n - p);
    while (zt) {
      for (int i = zt; i; i = (i - 1) & zt) {
        int f = 0;
        for (int j = (int)(0); j <= (int)(n - 1); j++)
          if (s[i] == dp[zt][p][q] && s[i] > dp[i ^ zt][p - 1][j] &&
              h[i][j] == q) {
            for (int o = (int)(0); o <= (int)(n - 1); o++)
              if (i >> o & 1) fa[o] = q;
            zt ^= i;
            p--;
            q = j;
            f = 1;
            break;
          }
        if (f) break;
      }
    }
    for (int i = (int)(0); i <= (int)(n - 1); i++) bj[i] = i + 1;
    for (int i = (int)(0); i <= (int)(n - 1); i++)
      if (fa[i] != i) {
        wri(bj[i]);
        writeln(bj[fa[i]]);
        for (int k = (int)(i + 1); k <= (int)(n - 1); k++) bj[k]--;
      }
  }
}
