package main

import (
	"fmt"
	"sort"
)

func solve() {
	var N1, N2 int
	fmt.Scan(&N1, &N2)
	var m int
	fmt.Scan(&m)
	A := make([]int, m)
	for i := 0; i < m; i++ {
		fmt.Scan(&A[i])
	}
	sort.Ints(A)
	dp := make([]int, N1 + 1)
	fillInt(dp, -1)
	dp[N1] = N2
	for j := 0; j < m; j++ {
		dp2 := make([]int, N1 + 1)
		fillInt(dp2, -1)
		hit := false

		for k := 0; k <= N1; k++ {
			if dp[k] >= 0 {
				if k >= A[j] {
					dp2[k - A[j]] = max(dp2[k - A[j]], dp[k])
					hit = true
				}
				if dp[k] >= A[j] {
					dp2[k] = max(dp2[k], dp[k] - A[j])
					hit = true
				}
			}
		}
		if !hit {
			fmt.Println(j)
			return
		}
		dp = dp2

	}
	fmt.Println(m)
}

func main() {
	var m int
	fmt.Scan(&m)
	for i := 0; i < m; i++ {
		solve()
	}

}

func max(a int, b int) int {
	if a < b {
		return b
	}
	return a
}
func fillInt(arr []int, v int) {
	for i := 0; i < len(arr); i++ {
		arr[i] = v
	}
}