Get excited, folks, because it is time for the final match of Codechef Premier League (CPL)!
Mike and Tracy also want to watch the grand finale, but unfortunately, they could not get tickets to the match. However, Mike is not someone who gives up so easily — he has a plan to watch the match.
The field where the match is played is surrounded by a wall with height $K$. Outside, there are $N$ boxes (numbered $1$ through $N$). For each valid $i$, the $i$-th box has a height $H_i$.
Mike wants to take some boxes and stack them on top of each other to build two towers. The height of each tower is the sum of heights of all the boxes that form it. Of course, no box may be in both towers. The height of each tower should be at least $K$. Then Mike can climb on top of one tower and Tracy on top of the other, and they can watch the match uninterrupted!
While Mike is busy stacking the boxes, Tracy would like to know the smallest number of boxes required to build two towers such that each of them has height at least $K$, or at least that it is impossible to build such towers. Can you help Tracy?

-----Input-----
- The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows.
- The first line of each test case contains two space-separated integers $N$ and $K$.
- The second line contains $N$ space-separated integers $H_1, H_2, \ldots, H_N$.

-----Output-----
For each test case, print a single line containing one integer — the smallest number of boxes required to build two towers, or $-1$ if it is impossible.

-----Constraints-----
- $1 \leq T \leq 5$
- $1 \leq N, K \leq 4,000$
- $1 \leq H_i \leq 10^5$ for each valid $i$

-----Subtasks-----
Subtask #1 (30 points):
- $1 \leq N, K \leq 100$
- $1 \leq H_i \leq 100$ for each valid $i$
Subtask #2 (70 points): original constraints

-----Example Input-----
2
8 38
7 8 19 7 8 7 10 20
4 5
2 10 4 9

-----Example Output-----
7
2

-----Explanation-----
Example case 1: The first tower can be built with boxes $8 + 10 + 20 = 38$ and the second tower with boxes $7 + 7 + 8 + 19 = 41$. In this case, the box with height $7$ is left unused.
Example case 2: We only need the box with height $10$ for one tower and the box with height $9$ for the other tower.

Source: codechef | Difficulty: UNKNOWN_DIFFICULTY


Solutions:
import sys
sys.setrecursionlimit(100000)
memo = {}

def recurse(arr, T1, T2, k, i):
	if T1 >= k and T2 >= k:
		return i
	if i >= len(arr):
		return float('inf')
	if (T1, T2) in memo:
		return memo[T1, T2]
	t1 = recurse(arr, T1 + arr[i], T2, k, i + 1)
	t2 = recurse(arr, T1, T2 + arr[i], k, i + 1)
	memo[T1, T2] = min(t1, t2)
	return memo[T1, T2]
for _ in range(int(input())):
	(n, k) = list(map(int, input().split()))
	lst = list(map(int, input().split()))
	lst.sort(reverse=True)
	memo = {}
	res = recurse(lst, 0, 0, k, 0)
	if res == float('inf'):
		print(-1)
	else:
		print(res)


def min_boxes(k, boxes):
	if len(boxes) == 1:
		return -1
	sum_ = sum(boxes)
	boxes = sorted(boxes, reverse=True)
	n = len(boxes)
	if sum_ < 2 * k:
		return -1
	elif boxes[0] >= k:
		B = boxes[1]
		if B >= k:
			return 2
		for i in range(2, n):
			B += boxes[i]
			if B >= k:
				return i + 1
		return -1
	table = [[False for _ in range(2 * k)] for _ in range(n + 1)]
	for i in range(n + 1):
		table[i][0] = True
	for i in range(1, n + 1):
		for j in range(1, 2 * k):
			if boxes[i - 1] > j:
				table[i][j] = table[i - 1][j]
			else:
				table[i][j] = table[i - 1][j] or table[i - 1][j - boxes[i - 1]]
	sum_till_here = 0
	for i in range(1, n + 1):
		sum_till_here += boxes[i - 1]
		for j in range(k, sum_till_here - k + 1):
			if table[i][j]:
				return i
	return -1

def __starting_point():
	test_cases = int(input())
	while test_cases:
		(n, k) = map(int, input().split())
		boxes = list(map(int, input().split()))
		print(min_boxes(k, boxes))
		test_cases -= 1
__starting_point()


for _ in range(int(input())):
	(n, k) = map(int, input().split())
	h = list(map(int, input().split()))
	sum = 0
	h.sort()
	h1 = set()
	h1.add(h[n - 1])
	summ = h[n - 1]
	z = -1
	for i in range(n - 2, -1, -1):
		h2 = set()
		summ = summ + h[i]
		i1 = iter(h1)
		while True:
			try:
				p = int(next(i1))
			except StopIteration:
				break
			h2.add(p)
			h2.add(h[i])
			h2.add(p + h[i])
			if p + h[i] >= k and summ - p - h[i] >= k:
				z = n - i
				break
			if h[i] >= k and summ - h[i] >= k:
				z = n - i
				break
		if z != -1:
			break
		h1 = h2
	print(z)


tc = int(input())
while tc != 0:
	count = 0
	(n, k) = map(int, input().split())
	h = sorted(map(int, input().split()))
	h.reverse()
	queue = [h[0]]
	sum2 = h[0]
	res = -1
	for i in range(1, len(h)):
		queue2 = []
		s = set()
		sum2 += h[i]
		for x in queue:
			if x not in s:
				queue2.append(x)
				s.add(x)
			if h[i] not in s:
				queue2.append(h[i])
				s.add(h[i])
			if x + h[i] not in s:
				queue2.append(x + h[i])
				s.add(x + h[i])
			if x + h[i] >= k and sum2 - x - h[i] >= k:
				res = i + 1
				break
			if h[i] >= k and sum2 - h[i] >= k:
				res = i + 1
				break
		if res != -1:
			break
		queue = queue2
	print(res)
	tc -= 1


for t in range(int(input())):
	(n, k) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	queue1 = [a[0]]
	summ = a[0]
	res = -1
	for i in range(1, len(a)):
		queue2 = []
		s = set()
		summ += a[i]
		for x in queue1:
			if x not in s:
				queue2.append(x)
				s.add(x)
			if a[i] not in s:
				queue2.append(a[i])
				s.add(a[i])
			if x + a[i] not in s:
				queue2.append(x + a[i])
				s.add(x + a[i])
			if x + a[i] >= k and summ - x - a[i] >= k:
				res = i + 1
				break
			if a[i] >= k and summ - a[i] >= k:
				res = i + 1
				break
		if res != -1:
			break
		queue1 = queue2
	print(res)


for _ in range(int(input())):
	(n, k) = map(int, input().split())
	h = list(map(int, input().split()))
	h.sort(reverse=True)
	h1 = []
	summ = 0
	for i in range(n):
		summ += h[i]
		h1.append(summ)
	dp = []
	ele = [200000] * (k + 1)
	dp.append(ele)
	for i in range(n):
		ele = [0] * (k + 1)
		dp.append(ele)
	for i in range(1, n + 1):
		for j in range(1, k + 1):
			if h[i - 1] >= j:
				dp[i][j] = h[i - 1]
			else:
				dp[i][j] = min(dp[i - 1][j], h[i - 1] + dp[i - 1][j - h[i - 1]])
	i = 1
	while i <= n:
		if h1[i - 1] - dp[i][k] >= k:
			break
		else:
			i += 1
	if i > n:
		print(-1)
	else:
		print(i)