Odd Queries
You have an array $$$a_1, a_2, \dots, a_n$$$. Answer $$$q$$$ queries of the following form:   If we change all elements in the range $$$a_l, a_{l+1}, \dots, a_r$$$ of the array to $$$k$$$, will the sum of the entire array be odd?  Note that queries are independent and do not affect future queries.
For the first test case:   If the elements in the range $$$(2, 3)$$$ would get set to $$$3$$$ the array would become $$$\{2, 3, 3, 3, 2\}$$$, the sum would be $$$2+3+3+3+2 = 13$$$ which is odd, so the answer is "YES". If the elements in the range $$$(2, 3)$$$ would get set to $$$4$$$ the array would become $$$\{2, 4, 4, 3, 2\}$$$, the sum would be $$$2+4+4+3+2 = 15$$$ which is odd, so the answer is "YES". If the elements in the range $$$(1, 5)$$$ would get set to $$$5$$$ the array would become $$$\{5, 5, 5, 5, 5\}$$$, the sum would be $$$5+5+5+5+5 = 25$$$ which is odd, so the answer is "YES". If the elements in the range $$$(1, 4)$$$ would get set to $$$9$$$ the array would become $$$\{9, 9, 9, 9, 2\}$$$, the sum would be $$$9+9+9+9+2 = 38$$$ which is even, so the answer is "NO". If the elements in the range $$$(2, 4)$$$ would get set to $$$3$$$ the array would become $$$\{2, 3, 3, 3, 2\}$$$, the sum would be $$$2+3+3+3+2 = 13$$$ which is odd, so the answer is "YES". 
Each test contains multiple test cases. The first line contains the number of test cases $$$t$$$ ($$$1 \le t \le 10^4$$$). The description of the test cases follows.The first line of each test case consists of $$$2$$$ integers $$$n$$$ and $$$q$$$ ($$$1 \le n \le 2 \cdot 10^5$$$; $$$1 \le q \le 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 \le a_i \le 10^9$$$) — the array $$$a$$$.The next $$$q$$$ lines of each test case consists of $$$3$$$ integers $$$l,r,k$$$ ($$$1 \le l \le r \le n$$$; $$$1 \le k \le 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.
import sys
from itertools import accumulate
input = sys.stdin.readline
print_ = sys.stdout.write

def solve():
    (n, q) = map(int, input().split())
    arr = [0] + list(map(int, input().split()))
    psum = list(accumulate(arr))
    for _ in range(q):
        (l, r, k) = map(int, input().split())
        total = psum[l - 1] + psum[n] - psum[r] + k * (r - l + 1)
        if total & 1:
            print_('yes\n')
        else:
            print_('no\n')
if __name__ == '__main__':
    t = int(input())
    for _ in range(t):
        solve()
import sys
out = []
for i in range(int(sys.stdin.readline())):
    (n, q) = map(int, sys.stdin.readline().split())
    m = 0
    x = [(m := (int(i) + m)) for i in sys.stdin.readline().split()]
    x.insert(0, 0)
    for i in range(q):
        (l, r, k) = map(int, sys.stdin.readline().split())
        if (k * (r - l + 1) + (x[-1] - x[r]) + x[l - 1]) % 2:
            out.append('YES')
        else:
            out.append('NO')
print('\n'.join(out))
import sys
input = sys.stdin.readline
out = []
for i in range(int(input())):
    (n, q) = map(int, input().split(' '))
    m = 0
    x = [(m := (int(i) + m)) for i in input().split()]
    x.insert(0, 0)
    for i in range(q):
        (l, r, k) = map(int, input().split(' '))
        if (k * (r - l + 1) + (x[-1] - x[r]) + x[l - 1]) % 2:
            out.append('YES')
        else:
            out.append('NO')
print('\n'.join(out))