#include <cstdio>

#include <cstring>

#include <algorithm>

using namespace std;

const int MAX_OBJ = , MAX_V = , MAX_CNT = MAX_OBJ;

//DP(obj, v, cnt)=max{DP(obj-1, v, cnt), DP(obj-1, v-objV[obj], cnt-1)+objW[obj]}

int DP(int totV, int totObj, int totCnt, int *objV, int *objW)

{

    static int DP[MAX_CNT][MAX_V];

    memset(DP, 0xcf, sizeof(DP));

    DP[][] = ;

    for (int obj = ; obj <= totObj; obj++)

        for (int cnt = totCnt; cnt >= ; cnt--)

            for (int v = totV; v >= ; v--)

                if (v >= objV[obj])

                    DP[cnt][v] = max(DP[cnt][v], DP[cnt - ][v - objV[obj]] + objW[obj]);

    int ans = ;

    for (int v = ; v <= totV; v++)

        ans = max(ans, DP[totCnt][v]);

    return ans;

}

int main()

{

#ifdef _DEBUG

    freopen("c:\\noi\\source\\input.txt", "r", stdin);

#endif

    static int objV[MAX_OBJ], objW[MAX_OBJ];

    int T, totObj, objLimit, totV;

    scanf("%d", &T);

    while (T--)

    {

        memset(objV, , sizeof(objV));

        memset(objW, , sizeof(objW));

        scanf("%d%d%d", &totObj, &objLimit, &totV);

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

            scanf("%d%d", i + objV, i + objW);

        printf("%d\n", DP(totV, totObj, objLimit, objV, objW));

    }

    return ;

}