package no393;

import java.util.Arrays;
import java.util.Scanner;

public class Main {

	public static Scanner sc = new Scanner(System.in);
	public static void main(String[] args) {
		int d = sc.nextInt();
		for(int i=0;i<d;i++) {
			solve();
		}
	}
	
	public static int LMAX = 100000;
	static boolean[] dp = new boolean[LMAX+1];
	public static void solve() {
		int l1 = sc.nextInt();
		int l2 = sc.nextInt();
		int n = sc.nextInt();
		int[] a = new int[n];
		for(int i=0;i<n;i++) {
			a[i] = sc.nextInt();
		}
		Arrays.sort(a);
		int l = 0;
		int r = n + 1;
		while(l + 1 < r) {
			int c = (l + r) / 2;
			Arrays.fill(dp, false);
			dp[0] = true;
			int sum = 0;
			for(int i=0;i<c;i++) {
				sum += a[i];
				for(int j=l1;j>=a[i];j--) {
					dp[j] |= dp[j-a[i]];
				}
			}
			boolean flag = false;
			for(int i=l1;i>=0;i--) {
				if (dp[i]) {
					flag = sum - i <= l2;
					break;
				}
			}
			if (flag) {
				l = c;
			}else{
				r = c;
			}
		}
		System.out.println(l);
	}

}