Problem: You are given an array a consisting of n elements. You may apply several operations (possibly zero) to it.

During each operation, you choose two indices i and j (1 ≤ i, j ≤ n; i ≠ j), increase a_j by a_i, and remove the i-th element from the array (so the indices of all elements to the right to it decrease by 1, and n also decreases by 1).

Your goal is to make the array a strictly ascending. That is, the condition a_1 < a_2 < ... < a_n should hold (where n is the resulting size of the array).

Calculate the minimum number of actions required to make the array strictly ascending.

Input

The first line contains one integer T (1 ≤ T ≤ 10000) — the number of test cases.

Each test case consists of two lines. The first line contains one integer n (1 ≤ n ≤ 15) — the number of elements in the initial array a.

The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^6).

It is guaranteed that: 

  * the number of test cases having n ≥ 5 is not greater than 5000; 
  * the number of test cases having n ≥ 8 is not greater than 500; 
  * the number of test cases having n ≥ 10 is not greater than 100; 
  * the number of test cases having n ≥ 11 is not greater than 50; 
  * the number of test cases having n ≥ 12 is not greater than 25; 
  * the number of test cases having n ≥ 13 is not greater than 10; 
  * the number of test cases having n ≥ 14 is not greater than 3; 
  * the number of test cases having n ≥ 15 is not greater than 1. 

Output

For each test case, print the answer as follows:

In the first line, print k — the minimum number of operations you have to perform. Then print k lines, each containing two indices i and j for the corresponding operation. Note that the numeration of elements in the array changes after removing elements from it. If there are multiple optimal sequences of operations, print any one of them.

Example

Input


4
8
2 1 3 5 1 2 4 5
15
16384 8192 4096 2048 1024 512 256 128 64 32 16 8 4 2 1
2
3 3
14
1 2 3 4 5 6 7 8 9 10 11 12 13 14


Output


3
6 8
1 6
4 1
7
1 15
1 13
1 11
1 9
1 7
1 5
1 3
1
2 1
0

Note

In the first test case, the sequence of operations changes a as follows:

[2, 1, 3, 5, 1, 2, 4, 5] → [2, 1, 3, 5, 1, 4, 7] → [1, 3, 5, 1, 6, 7] → [2, 3, 5, 6, 7].

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 15;
int ans[N], mid[N], sum[1 << N];
vector<int> v;
bool dfs(int p, int s, int n) {
  if (p == n) {
    for (int i = 0; i < n; ++i) ans[i] = mid[i];
    ans[n - 1] |= s;
    return 1;
  }
  if (v[p] > v[p - 1]) {
    mid[p] = 0;
    return dfs(p + 1, s, n);
  }
  for (int i = s; i > 0; i = ((i - 1) & s))
    if (v[p] + sum[i] > v[p - 1]) {
      v[p] += sum[i];
      mid[p] = i;
      if (dfs(p + 1, s ^ i, n)) return 1;
      v[p] -= sum[i];
    }
  return 0;
}
void solve(int n) {
  vector<vector<int>> bt(n);
  for (int i = 0; i < (1 << n) - 1; ++i) bt[__builtin_popcount(i)].push_back(i);
  vector<int> a(n);
  for (int i = 0; i < n; ++i) cin >> a[i];
  for (int b = 0; b < n; ++b)
    for (int s : bt[b]) {
      vector<int> vec;
      vector<int> id[2];
      v.clear();
      int nl = 0, nr = 0;
      for (int i = 0; i < n; ++i) {
        int t = (s >> i) & 1;
        if (t)
          vec.push_back(a[i]), ++nr;
        else
          v.push_back(a[i]), ++nl;
        id[t].push_back(i + 1);
      }
      for (int i = 0; i < 1 << nr; ++i) {
        sum[i] = 0;
        for (int j = 0; j < nr; ++j)
          if ((i >> j) & 1) sum[i] += vec[j];
      }
      if (!dfs(1, (1 << nr) - 1, nl)) continue;
      cout << nr << ('\n');
      for (int i = 0; i < nl; ++i)
        for (int j = 0; j < nr; ++j)
          if ((ans[i] >> j) & 1) {
            cout << id[1][j] << ' ' << id[0][i] << ('\n');
            for (int k = 0; k < 2; ++k)
              for (int &l : id[k]) l -= l > id[1][j];
          }
      return;
    }
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int QAQ, n;
  for (cin >> QAQ; QAQ; QAQ--) cin >> n, solve(n);
}