#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
#define max(a, b) (a>b?a:b)

int V[21], W[21], Ans, N, K, L, i;

void DFS(int p, int vv, int ww, int num)
{
    if(vv>Ans) Ans = vv;
    if(ww>L) return;
    if(num==K) return;
    int i;
    for(i=p; i<N; i++) 
        DFS(i+1, vv+V[i], ww+W[i], num+1); //注意，這里的p是i+1， 而不p+1,我去，不然一直超時呀。
}

int main()
{
    int Case, i;
    scanf("%d", &Case);
    while(Case--)
    {
        scanf("%d%d", &N, &K);
        for(i=0; i<N; i++) scanf("%d%d", &V[i], &W[i]);
        scanf("%d", &L);

        Ans = 0;
        DFS(0, 0, 0, 0);

        printf("%d\n", Ans);
    }
}