def solve(): N, S = map(int, input().split()) A = list(map(int, input().split())) mask = (1 << (S+1)) - 1 b = 0 for a in A: b = mask & (b | (b << a) | (1 << a)) for i in reversed(range(S+1)): if b & (1 << i): return i return 0 T = int(input()) for _ in range(T): ans = solve() print(ans)