#include <cmath>

 #include <cstdio>

 #include <vector>

 #include <iostream>

 #include <algorithm>

 #include <cstring>

 using namespace std;

 #define MAX_N 100008

 int T, N;

 long long score[MAX_N];

 long long sum[MAX_N];

 long long best[MAX_N];

 int main() {

     /* Enter your code here. Read input from STDIN. Print output to STDOUT */

     cin >> T;

     while (T--) {

         cin >> N;

         memset(sum, , sizeof(sum));

         memset(best, , sizeof(best));

         for (int i = ; i <= N; i++)

             cin >> score[i];

         for (int i = N; i >= ; i--)

             sum[i] = score[i] + sum[i + ];

         best[N] = sum[N];

         best[N - ] = sum[N - ];

         best[N - ] = sum[N - ];

         for (int i = N - ; i >= ; i--)

             for (int j = ; j <= ; j++)

                 best[i] = max(best[i], sum[i] - best[i + j]);

         cout << best[] << endl;

     }

     return ;

 }