#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = (a); i <= (b); i++)
#define red(i, a, b) for(int i = (a); i >= (b); i--)
#define PB push_back
#define MP make_pair

#define X first
#define Y second
typedef pair<int, int> pii;
const int INF = 2e9;
const int MAXN = 20010;
typedef long long ll;
const int mod = 998244353;
const double eps = 1e-10;


int n;
int v[MAXN], s[MAXN];
int f[MAXN][160];
bool vis[MAXN][160];

int Solve(int i, int k)
{
    //cout << i << " " << k << endl;
    if (n - i + 1 < k) return 0;
    int tmp;
    if (vis[i][k]) return f[i][k];
    
    int l = i, r = i + k - 1, res;
    res = s[r] - s[l - 1] - Solve(i + k, k);
    if (r < n)
    {
        ++r;
        res = max(res, s[r] - s[l - 1] - Solve(i + k + 1, k + 1));
    }
    f[i][k] = res;
    vis[i][k] = true;
    return res;
}


int main() 
{
    //freopen("input", "r", stdin);
    //freopen("output", "w", stdout);
   
   
    int T;
    scanf("%d", &T);
    while (T--)
    {
        memset(vis, 0, sizeof(vis));
        scanf("%d", &n);
        for (int i = 1; i <= n; ++i)
            scanf("%d", &v[i]), s[i] = s[i - 1] + v[i];
        printf("%d\n", Solve(1, 1));
    }
    return 0;
}