Prateek Bhaiya wants to give a party to his N TAs, where each TA is numbered from 1 to N. His TAs are asking for a gift to come to the party, instead of giving him one. The cost of the gifts are given in the array Value where ith TA asks for a gift which has a cost CostI.
But, Prateek Bhaiya has only X amount of money to spend on gifts and he wants to invite his TAs which are in continuous range such that sum of the cost of the gifts of those TAs will be exactly equal to X.
If he can invite his TAs, who can satisfy the above condition then, print YES otherwise print NO.
Input Format:
The first line contains a single integer T, denoting the number of test cases.
Each test case has following lines:
The next line contains two space-separated integers N and X, where N represents the number of TAs and X represents amount of money which Prateek Bhaiya can spend on gifts.
Next N line contains N integers, where ith line contains ith integer, which represents the Costi .
Constraints:
1 <= T <= 10
1 <= N , Costi <= 10^6
1 <= X <= 10^12
Output Format:
Output exactly T lines, each containing the answer to the corresponding test case .
Sample Input:
1
5 12
1
3
4
5
2
Sample Output:
YES
Explanation:
As TAs numbered from 2 to 4 (inclusively) have gifts value which are {3, 4, 5}, and their sum equals to 12 - that is, the given value of X. So, the answer is YES
in one test case it is showing TLE