#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a,b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout<<" "<<kbrni;cout<<endl
#define smap(m) cout<<#m<<":";each(kbrni,m)cout<<" {"<<kbrni.first<<":"<<kbrni.second<<"}";cout<<endl

using namespace std;

typedef pair<int,int>P;

const int MAX_N = 100005;

bool dp[MAX_N];

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int d;
    cin >> d;
    rep(id,d){
        int p,q,a,b;
        cin >> p >> q;
        a = max(p,q),b = min(p,q);
        int sm = a + b;
        rep(i,b+1){
            dp[i] = false;
        }
        dp[b] = true;
        int m;
        cin >> m;
        vector<int> vec(m);
        rep(i,m){
            cin >> vec[i];
        }
        sort(all(vec));
        int lp = 0;
        int cri = 0;
        while(lp < m){
            bool flag = true;
            if(cri+vec[lp] > sm){
                break;
            }
            rep(i,vec[lp]){
                if(dp[i]){
                    if(sm-cri-i >= vec[lp]){
                        flag = false;
                        continue;
                    }
                    dp[i] = false;
                }
            }
            for(int i=vec[lp];i<=b;i++){
                if(dp[i]){
                    flag = false;
                    if(sm-cri-i < vec[lp]){
                        dp[i] = false;
                    }
                    dp[i-vec[lp]] = true;
                }
            }
            if(flag){
                break;
            }
            cri += vec[lp];
            lp++;
        }
        cout << lp << endl;
    }
    return 0;
}