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