{"trustable":false,"sections":[{"title":"","value":{"format":"MD","content":"Given a set S of integers, your task is to determine how many different non-empty subsets sum up to a target value T."}},{"title":"INPUT","value":{"format":"MD","content":"The first line of each test case is a line containing two integers N and T, the number of items of the original set of integers and the target value. After that comes\none line with the N integers s\u003csub\u003ei\u003c/sub\u003e that belong to the original set s.\n\n* 1 ≤ N ≤ 40\n* −10\u003csup\u003e9\u003c/sup\u003e ≤ T, s\u003csub\u003ei\u003c/sub\u003e ≤ 10\u003csup\u003e9\u003c/sup\u003e"}},{"title":"OUTPUT","value":{"format":"MD","content":"For each test case print on a single line an integer indicating the number of different non-empty subsets that sum up to the target value T.\n"}},{"title":"SAMPLE INPUT","value":{"format":"MD","content":"```\n6 0\n-1 2 -3 4 -5 6\n5 0\n-7 -3 -2 5 8\n```"}},{"title":"SAMPLE OUTPUT","value":{"format":"MD","content":"```\n4\n1\n```"}},{"title":"EXPLANATION","value":{"format":"MD","content":"On the first test case the target is 0 and the following are the valid subsets: (2, 4, -1, -5), (2, 6, -5,\n-3), (4, -1, -3), (6, -5, -1)."}}]}