#include <bits/stdc++.h>

using namespace std;

using i64 = long long;
const int N = 100005;
int n;
i64 s[N];

int main() {
  int t;
  cin >> t;
  while (t--) {cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> s[i];
    s[i] += s[i - 1];
  }

  i64 ans = 0, mx = s[1], mn = s[1];

  for (int j = 2; j < n; j++) {
    mx = max(mx, s[j - 1]);
    mn = min(mn, s[j - 1]);
    ans = max(ans, abs(s[n] - s[j]) + max(abs(s[j] - mx) + abs(mx - s[1]), abs(s[j] - mn) + abs(mn - s[1])));
  }
  cout << ans << endl;
  	
  }
  
}