B'You are playing a game called Slime Escape. The game takes place on a number line. Initially, there are n slimes. For all positive integers i where 1 <= i <= n , the i -th slime is located at position i and has health a_i . You are controlling the slime at position k . There are two escapes located at positions 0 and n+1 . Your goal is to reach any one of the two escapes by performing any number of game moves. In one game move, you move your slime to the left or right by one position. However, if there is another slime in the new position, you must absorb it. When absorbing a slime, the health of your slime would be increased by the health of the absorbed slime, then the absorbed slime would be removed from the game. Note that some slimes might have negative health, so your health would decrease when absorbing such slimes. You lose the game immediately if your slime has negative health at any moment during the game. Can you reach one of two escapes by performing any number of game moves, without ever losing the game? Each test contains multiple test cases. The first line contains a single integer t ( 1 <= q t <= q 20 ,000 ) -- the number of test cases. Description of the test cases follows. The first line of each test case contains two positive integers n , k ( 3 <= q n <= q 200 ,000 , 1 <= q k <= q n ) -- the number of slimes and the position of your slime. The second line of each test case contains n integers, a_1, a_2, ldots, a_n ( -10^9 <= q a_i <= q 10^9 ) -- the health of the slimes. It is guaranteed that health of your slime is non-negative ( a_k geq 0 ), and all other slimes have non-zero health ( a_i ne 0 for i ne k ). It is guaranteed that the sum of n over all test cases does not exceed 200 ,000 . For each test case, print "YES" (without quotes) if you can escape without losing, and "NO" (without quotes) otherwise'...