#include <bits/stdc++.h>
using namespace std;
const int N = int(3e5) + 12, mod = int(1e9) + 7;
int t, n, a[N];
void solve() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  if (n == 1) {
    printf("0 0 0\n");
    return;
  }
  int last = 0;
  for (int i = 1; i < n; i++) {
    if (2 * i > n) break;
    if (a[i] > a[i + 1]) {
      last = i;
    }
  }
  int g = 0, b = 0, second = 0;
  for (int i = 1; i <= last; i++) {
    g++;
    if (a[i] > a[i + 1]) {
      for (int j = i + 1; j <= last; j++) {
        second++;
        if (a[j] > a[j + 1]) break;
      }
      b = last - g - second;
      break;
    }
  }
  if (g > 0 && b > 0 && second > 0)
    printf("%d %d %d\n", g, second, b);
  else
    printf("0 0 0\n");
}
int main() {
  scanf("%d", &t);
  while (t--) {
    solve();
  }
  return 0;
}
