B'You have an array a_1, a_2, ... , a_n . Answer q queries of the following form: Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 10^4 ). The description of the test cases follows. The first line of each test case consists of 2 integers n and q ( 1 <= n <= 2 cdot 10^5 ; 1 <= q <= 2 cdot 10^5 ) -- the length of the array and the number of queries. The second line of each test case consists of n integers a_i ( 1 <= a_i <= 10^9 ) -- the array a . The next q lines of each test case consists of 3 integers l,r,k ( 1 <= l <= r <= n ; 1 <= k <= 10^9 ) -- the queries. It is guaranteed that the sum of n over all test cases doesn 't exceed 2 cdot 10^5 , and the sum of q doesn 't exceed 2 cdot 10^5 . For each query, output "YES" if the sum of the entire array becomes odd, and "NO" otherwise. You can output the answer in any case (upper or lower). For example, the strings "yEs", "yes", "Yes", and "YES" will be recognized as positive responses. For the first test case: '...