E-Sequence_2026牛客五一集训派对day4

时间限制：C/C++/Rust/Pascal 2秒，其他语言4秒
空间限制：C/C++/Rust/Pascal 512 M，其他语言1024 M
64bit IO Format: %lld

题目描述

You have an array of $n$ elements $a_1, \ a_2,\dots,\ a_n$ .

For each task, you have three integers $l,r,k$ .

Ask whether you can find an array $b$ of $k-1$ integers satisfy:

$\bullet$ $\ \ l \le \ b_1 < \ b_2 < \ b_3 < \dots < \ b_{k-1} < \ r$

$\bullet$ $\ sum(l,$ $b_1) ,\ sum(b_1+1,$ $b_2), \dots ,\ sum(b_{k-1}+1 ,\ r)$ are the multiplies of $2$

Specially, if $k=1$ , it should satisfy $sum(l,r)$ is the multiply of $2$

We define $sum(l,$ $r) = \sum_{i=l}^{r} \ a_i$ $(l\le r)$ .

If possible, print "YES". Otherwise, print "NO".

输入描述:

Each test contains multiple test cases. The first line contains the number of test cases .
The description of the test cases follows.

The first line contains two integers ().

The second line contains  integers ().

Each of the next  lines contains three integers ().

It's guaranteed that

输出描述:

For each test case, output "YES" or "NO".

示例1

输入

复制

输出

复制

NO
YES
NO
YES
YES
NO