def solve():
    N,S=map(int,input().split())
    A=list(map(int,input().split()))
    C=1
    mask=(1<<(S+1))-1
    for i in A:
        if i<=S:
            C|=C<<i
            C&=mask
    print(C.bit_length()-1)
    return
    

def main():
    T=int(input())
    for i in range(T):
        solve()
    return

if __name__=="__main__":
    main()