#include<bits/stdc++.h>
using namespace std;

#include<atcoder/all>
using namespace atcoder;
using mint=atcoder::modint1000000007;

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#define int long long

#define rep(i,n) for(int i=0;i<(n);i++)
#define rng(i,l,r) for(int i=(l);i<(r);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrng(i,l,r) for(int i=(r)-1;i>=(l);i--)

#define fi first
#define se second
#define all(x) (x).begin(),(x).end()

struct fast_io{fast_io(){std::cin.tie(nullptr)->sync_with_stdio(false);}}_;

void solve();

signed main(){
	int T;cin>>T;

	while(T--){
		solve();
	}
}

void solve(){

	int N;cin>>N;
	vector<int> A(N);for(auto&&e:A)cin>>e;

	vector<int> sm={0};
	for(auto&&e:A)sm.push_back(sm.back()+e);

	int mn=0,mx=0;
	int ans=0;

	rep(i,N-1){
		mn=min(mn,sm[i]);
		mx=max(mx,sm[i]);
		ans=max(ans,abs(sm[N]-sm[i+1])+abs(sm[i+1]-mn)+abs(mn));
		ans=max(ans,abs(sm[N]-sm[i+1])+abs(sm[i+1]-mx)+abs(mx));
	}

	cout<<ans<<endl;
}