#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
#include <iterator>
using namespace std;

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

    while(--d >= 0){
        int x, y, m;
        cin >> x >> y >> m;
        vector<int> a(m);
        for(int i=0; i<m; ++i)
            cin >> a[i];
        sort(a.begin(), a.end());

        vector<int> dp(x + 1, -1);
        dp[x] = y;
        int ans = 0;
        for(int i=0; i<m; ++i){
            vector<int> nextDp(x + 1, -1);
            for(int j=0; j<=x; ++j){
                if(dp[j] == -1)
                    continue;

                nextDp[j] = max(nextDp[j], dp[j] - a[i]);
                int k = j - a[i];
                if(k >= 0)
                    nextDp[k] = max(nextDp[k], dp[j]);
            }

            dp.swap(nextDp);
            if(dp == vector<int>(x + 1, -1))
                break;
            ++ ans;
        }
        cout << ans << endl;
    }

    return 0;
}