#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)

int main() {
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	
	int T;
	cin >> T;
	
	const ll INF = 1ll << 60;
	
	rep(testcase, 0, T) {
		int N;
		cin >> N;
		vector<ll> A(N);
		rep(i, 0, N) cin >> A[i];
		rep(i, 1, N) A[i] += A[i - 1];
		
		vector<ll> maxi(N, -INF), mini(N, INF);
		for (int i = N - 2; i >= 0; --i) {
			maxi[i] = max(maxi[i + 1], A[i]);
			mini[i] = min(mini[i + 1], A[i]);
		}
		ll ans = 0;
		rep(i, 0, N - 2) {
			ans = max(ans, abs(A[i]) + abs(maxi[i + 1] - A[i]) + abs(maxi[i + 1] - A[N - 1]));
			ans = max(ans, abs(A[i]) + abs(mini[i + 1] - A[i]) + abs(mini[i + 1] - A[N - 1]));
		}
		
		cout << ans << '\n';
	}
}