#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const int32_t M = 1e9 + 7;
const long long N = 1e6 + 5;
void no() { cout << "0 0 0" << endl; }
void cpc() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(NULL);
}
void solve() {
  long long n;
  cin >> n;
  vector<long long> v(n);
  for (long long i = 0; i < n; i++) cin >> v[i];
  long long j = n / 2 - 1;
  while (j >= 4 && v[j] <= v[j + 1]) j--;
  if (j < 4) {
    no();
    return;
  }
  deque<long long> va;
  va.push_front(j);
  j--;
  while (j >= 0) {
    if (v[j] > v[j + 1]) va.push_front(j);
    j--;
  }
  va.push_front(-1);
  if (va.size() < 4) {
    no();
    return;
  }
  long long a, b, c, d;
  a = va[0];
  b = va[1];
  c = -1;
  d = va[va.size() - 1];
  long long dis = b - a;
  for (long long i = 0; i < n; i++) {
    if ((va[i] - b) > dis) {
      c = va[i];
      break;
    }
  }
  if (c == -1 || (d - c) <= dis) {
    no();
    return;
  }
  cout << b - a << " " << c - b << " " << d - c << " " << endl;
}
int32_t main() {
  cpc();
  long long t;
  cin >> t;
  while (t--) solve();
  return 0;
}
