#include<iostream>

#include<cstring>

#include<cstdio>

#include<cstdlib>

#include<algorithm>

using namespace std;

int main()

{

    int t;

    scanf("%d",&t);

    while(t--)

    {

        int n,v,k;

        scanf("%d%d%d",&n,&v,&k);

        int dp[v+][k+],w[n],c[n];

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

            scanf("%d",&w[i]);

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

            scanf("%d",&c[i]);

        memset(dp,,sizeof(dp));

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

        {

            int ic = c[i];

            int iw = w[i];

            for(int iv = v;iv>=ic;--iv)

            {

                int tempA[k+],tempB[k+];

                int ia,ib,ik;

                ia = ib = ik = ;

                for(;ik<k;++ik)

                {

                    tempA[ia++] = dp[iv][ik];

                    tempB[ib++] = dp[iv-ic][ik] + iw;

                }

                tempA[ia] = -;

                tempB[ib] = -;

                ia = ib = ik = ;

                while(ik<k&&(tempA[ia]!=-||tempB[ia]!=-))

                {

                    if(tempA[ia] > tempB[ib])

                    {

                        dp[iv][ik] = tempA[ia++];

                    }

                    else

                    {

                        dp[iv][ik] = tempB[ib++];

                    }

                    if(ik== || dp[iv][ik] != dp[iv][ik-])

                    {

                        ++ik;

                    }

                }

            }

        }

        printf("%d\n",dp[v][k-]);

    }

    return ;

}