#include <bits/stdc++.h>
#include <atcoder/all>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
namespace mp = boost::multiprecision;
using Bint = mp::cpp_int;
using namespace std;
using namespace atcoder;
#define rep(i, n) for(int i=0;i<(n);++i)
#define rep1(i, n) for(int i=1;i<=(n);i++)
#define ll long long
using mint = modint998244353;
using P = pair<ll,ll>;
using lb = long double;
using T = tuple<ll, ll, ll>;
#ifdef LOCAL
#  include <debug_print.hpp>
#  define dbg(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define dbg(...) (static_cast<void>(0))
#endif

ll op(ll a, ll b) {
    return max(a,b);
}

ll e() {
    return -1e18;
}

ll op2(ll a, ll b) {
    return min(a,b);
} 

ll e2() {
    return 1e18;
}

int main()
{
    int t;
    cin >> t;
    while(t--) {
        int n;
        cin >> n;
        vector<int> a(n);
        rep(i,n) cin >> a[i];
        vector<ll> s(n+1);
        rep(i,n) s[i+1] = s[i] + a[i];
        vector<pair<ll,int>> vs;
        rep(i,n+1) vs.emplace_back(s[i],i);
        sort(vs.begin(),vs.end());
        vector<int> id(n+1);
        rep(i,n+1) {
            id[vs[i].second] = i;
        }
        segtree<ll,op,e> maxseg(n+1);
        segtree<ll,op2,e2> minseg(n+1);
        dbg(id,s);
        ll ans = 0;
        for(int i=n-1;i>=1;i--) {
            if(id[i]<id[n] && maxseg.prod(id[i],id[n])!=-1e18) ans = max(ans, s[n]-s[i]+abs(s[i]));
            ll v1 = maxseg.prod(max(id[i],id[n]),n+1);
            ll v2 = minseg.prod(0, min(id[i],id[n]));
            ans = max(ans, 2*v1-s[i]-s[n]+abs(s[i]));
            ans = max(ans, s[n]+s[i]-2*v2+abs(s[i]));
            maxseg.set(id[i],s[i]);
            minseg.set(id[i],s[i]);
        }
        cout << ans << endl;
    }
    return 0;
}