#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
using namespace std;

#define REP(i, x) for (int i = 0; i < (x); i++)
#define REPE(i, x) for (int i = 0; i <= (x); i++)
#define RREP(i, x) for (int i = (x) - 1; i >= 0; i--)
#define RREPE(i, x) for (int i = (x); i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORE(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a) - 1; i >= (b); i--)
#define RFORE(i, a, b) for (int i = (a); i >= (b); i--)
#define ALL(a) (a).begin(), (a).end()

typedef pair<int, int> PII;

const int kMaxN = 100010;
const int kMaxM = 70;

int dp[kMaxM][kMaxN];
int A[kMaxM];

int main() {
    int d;
    cin >> d;

    while (d--) {
        int n1, n2, m;
        cin >> n1 >> n2;

        cin >> m;
        REP (i, m) {
            cin >> A[i];
        }

        sort(A, A + m);

        memset(dp, 0, sizeof(dp));

        int ans = 0, should_use = 0;
        FORE (b_num, 1, m) {
            REPE(use, n1) {

                if (use - A[b_num - 1] >= 0) {
                    dp[b_num][use] = max(dp[b_num][use], dp[b_num - 1][use - A[b_num - 1]] + 1);
                }

                int other_use = should_use - use;
                if (other_use >= 0 && other_use + A[b_num - 1] <= n2) {
                    dp[b_num][use] = max(dp[b_num][use], dp[b_num - 1][use] + 1);
                }
                ans = max(ans, dp[b_num][use]);
            }
            should_use += A[b_num - 1];
        }
        cout << ans << endl;
    }
    return 0;
}