#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int N = 1e5 + 4;
const long long MOD = 998244353;
bool ans[2 * N];
long long POW(long long base, long long exponent) {
  long long result = 1;
  while (exponent > 0) {
    if (exponent % 2 == 1) result = (result * base) % MOD;
    exponent = exponent >> 1;
    base = (base * base) % MOD;
  }
  return result;
}
long long Inv(long long x) { return POW(x, MOD - 2); }
void BFS(int s, vector<int> &d, vector<int> edge[]) {
  d[s] = 0;
  queue<int> q;
  q.push(s);
  while (!q.empty()) {
    int v = q.front();
    q.pop();
    for (auto to : edge[v]) {
      if (d[to] == (int)1e9) {
        d[to] = d[v] + 1;
        q.push(to);
      }
    }
  }
}
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    int a[n];
    for (int i = 0; i < n; i++) cin >> a[i];
    int l = 0, r = n - 1, ls = 0, rs = 0, al = 0, b = 0, mv = 0;
    while (l <= r) {
      if (mv & 1) {
        rs = 0;
        while (rs <= ls and r >= l) rs += a[r--];
        b += rs;
        mv++;
      } else {
        ls = 0;
        while (ls <= rs and l <= r) ls += a[l++];
        al += ls;
        mv++;
      }
    }
    cout << mv << ' ' << al << ' ' << b << '\n';
  }
  return 0;
}
