#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto& i:a)
#define ff first 
#define ss second 
#define all(a) begin(a),end(a)
#define allr(a) rbegin(a),rend(a)
#define pb push_back
using ll =long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using vi=vector<int>;
using vll=vector<ll>;
template<class T> inline bool chmin(T& a,T b){return a>b?a=b,1:0;}
template<class T> inline bool chmax(T& a,T b){return a<b?a=b,1:0;}

const int INFI=numeric_limits<int>::max()/2;
const ll INFL=numeric_limits<ll>::max()/2;

#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
template<typename T,typename F>
struct SegmentTree{
private:
    int n;
    vector<T> data;
    const F f;
    T ti;
public:
    SegmentTree()=default;
    SegmentTree(int n,F f,T ti):n(n),f(f),ti(ti),data(n<<1,ti){}
    SegmentTree(vector<T> v,F f,T ti):n(v.size()),f(f),ti(ti),data(n<<1,ti){
        for(int i=0;i<n;i++)data[i+n]=v[i];
        for(int i=n-1;i>=1;i--)data[i]=f(data[i<<1],data[i<<1|1]);
    }
    void update(int k,const T& val){
        k+=n;
        data[k]=val;
        for(k>>=1;k>=1;k>>=1){
            data[k]=f(data[k<<1],data[k<<1|1]);
        }
    }
    const T operator[](const int &k){return data[k+n];}
    void apply(int k,const T& val){
        update(k,f(data[k+n],val));
    }
    const T prod(int l,int r){
        l+=n;r+=n;
        T vl=ti,vr=ti;
        for(;l<r;l>>=1,r>>=1){
            if(l&1)vl=f(vl,data[l++]);
            if(r&1)vr=f(data[--r],vr);
        }
        return f(vl,vr);
    }
};
template<typename T,typename F>
SegmentTree<T,F> get_SegmentTree(int n,F f,T ti){return SegmentTree<T,F>(n,f,ti);}
template<typename T,typename F>
SegmentTree<T,F> get_SegmentTree(vector<T> v,F f,T ti){return SegmentTree<T,F>(v,f,ti);}

int n;
vll a;
void solve(){
    rep(i,1,n){
        a[i]+=a[i-1];
    }
    auto seg1=get_SegmentTree(n,[](ll a,ll b){return max(a,b);},-INFL);//|pref|-pref
    auto seg2=get_SegmentTree(n,[](ll a,ll b){return max(a,b);},-INFL);//|pref|+pref
    vll v=a;sort(all(v));v.erase(unique(all(v)),end(v));
    ll ans{-INFL};
    rep(j,0,n-1){
        int pos=lb(v,a[j]);
        chmax(ans,seg1.prod(0,pos)+a[j]+abs(a[n-1]-a[j]));
        chmax(ans,seg2.prod(pos,n)-a[j]+abs(a[n-1]-a[j]));
        seg1.apply(pos,abs(a[j])-a[j]);
        seg2.apply(pos,abs(a[j])+a[j]);
    }
    cout<<ans<<endl;
}
int main(){
    cin.tie(0)->sync_with_stdio(0);
    int t;cin>>t;
    while(t--){
        cin>>n;
        a.resize(n);
        rep(i,0,n){
            cin>>a[i];
        }
        solve();
    }
    return 0;
}
/*

*/