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();
		if (d <= 0 || d > 10)
			throw new AssertionError();
		for (; d > 0; d--) {
			new Main().solver();
		}
	}

	void solver() {
		int n1 = sc.nextInt();
		int n2 = sc.nextInt();
		if (n1 < 0 || n1 > 100000 || n2 < 0 || n2 > 100000) {
			throw new AssertionError();
		}
		int m = sc.nextInt();
		if (m <= 0 || m > 60)
			throw new AssertionError();
		int[] a = new int[m];
		for (int i = 0; i < m; i++) {
			a[i] = sc.nextInt();
			if (a[i] > 100000 || a[i] <= 0)
				throw new AssertionError();
		}

		Arrays.sort(a);

		boolean[] from = new boolean[n1 + 1];
		from[0] = true;
		int len = 0;
		for (int i = 0; i < m; i++) {
			boolean[] to = new boolean[100001];
			boolean f = false;
			for (int j = 0; j <= n1; j++) {
				if (from[j]) {
					if (j + a[i] <= n1) {
						to[j + a[i]] = true;
						f = true;
					}
					if ((len - j) + a[i] <= n2) {
						to[j] = true;
						f = true;
					}
				}
			}

			len += a[i];
			from = to;

			if (!f) {
				System.out.println(i);
				return;
			}
		}
		System.out.println(m);
	}

	void tr(Object... o) {
		System.out.println(Arrays.deepToString(o));
	}

}