#include <bits/stdc++.h>
using namespace std;
int t, n;
const int maxn = 400005;
long long int p[maxn];
int main() {
  cin >> t;
  while (t--) {
    int i, h, j;
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> p[i];
    for (i = 1; 3 * i + 2 <= n / 2; i++) {
      if (p[i] > p[i + 1]) break;
    }
    if (p[i] > p[i + 1]) {
      for (h = i + 1; h + 2 * i + 1 <= n / 2; h++) {
        if (p[h] > p[h + 1]) break;
      }
      if (p[h] > p[h + 1]) {
        for (j = i + h + 1; i + h + j <= n / 2; j++) {
          if (p[j] > p[j + 1]) break;
        }
        if (p[j] > p[j + 1])
          printf("%d %d %d\n", i, h, j);
        else
          printf("0 0 0\n");
      } else {
        printf("0 0 0\n");
      }
    } else {
      printf("0 0 0\n");
    }
  }
  return 0;
}
