#include <map>

#include <set>

#include <list>

#include <cmath>

#include <queue>

#include <stack>

#include <cstdio>

#include <vector>

#include <string>

#include <cctype>

#include <complex>

#include <cassert>

#include <utility>

#include <cstring>

#include <cstdlib>

#include <iostream>

#include <algorithm>

using namespace std;

typedef pair<int,int> PII;

typedef long long ll;

#define lson l,m,rt<<1

#define pi acos(-1.0)

#define rson m+1,r,rt<<11

#define All 1,N,1

#define read freopen("in.txt", "r", stdin)

const ll  INFll = 0x3f3f3f3f3f3f3f3fLL;

const int INF= 0x7ffffff;

const int mod =  ;

int dp[][],sum[],n,m,d;

int judge(int x){

    dp[][]=;

    dp[][]=INF;

    for(int i=;i<=n;++i){

            dp[i][]=dp[i][]=INF;

        for(int l=;l<=d&&(i-*l)>=;++l){

            if(sum[i]-sum[i-l]>x)break;

            if(sum[i-l]-sum[i-*l]<=x){

                dp[i][]=min(dp[i][],dp[i-*l][]+);

                 dp[i][]=min(dp[i][],dp[i-*l][]+);

            }

        }

    }

    return dp[n][(m-)%]>m-;

}

int main()

{

    int t;

    scanf("%d",&t);

    while(t--){

        scanf("%d%d%d",&n,&m,&d);

        int a;

        sum[]=;

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

        {

            scanf("%d",&a);

            sum[i]=sum[i-]+a;

        }

        if(n%||n<*(m-)||n>*d*(m-))

        {

            printf("BAD\n");continue;

        }

         int l=,r=sum[n];

         while(l<=r){

            int mid=(l+r)>>;

            if(judge(mid))l=mid+;

            else r=mid-;

         }

         printf("%d\n",l);

    }

return ;

}