#include <iostream>
#include <vector>
using namespace std;

void solve(){
  int n;
  cin >> n;
  vector<long long> a(n);
  long long s = 0;
  for(int i = 0; i < n; i++){
    cin >> a[i];
    s += a[i];
  }
  long long ans = abs(a[0]) + abs(a[1]) + abs(s - a[0] - a[1]), pf = a[0] + a[1], pfmin = min(pf, a[0]), pfmax = max(pf, a[0]);
  for(int j = 2; j < n - 1; j++){
    pf += a[j];
    ans = max(ans, max(abs(pfmin) + abs(pf - pfmin), abs(pfmax) + abs(pf - pfmax)) + abs(s - pf));
    pfmin = min(pf, pfmin);
    pfmax = max(pf, pfmax);
  }
  cout << ans << "\n";
}

int main(){
  std::ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int t;
  cin >> t;
  while(t--){
    solve();
  }
}