问题 E: Sequence

You have an array of $n$ elements a1, a2,…, ana_1, \ a_2,\dots,\ a_na1, a2,…, an.

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

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

$\bullet$   l≤ b1< b2< b3<⋯< bk−1< r\ \ l \le \ b_1 < \ b_2 < \ b_3 < \dots < \ b_{k-1} < \ r  l≤ b1< b2< b3<⋯< bk−1< r
If possible, print "YES". Otherwise, print "NO

Each test contains multiple test cases. The first line contains the number of test cases T(1≤T≤10000)T(1\le T\le 10000)T(1≤T≤10000).
The description of the test cases follows.
The first line contains two integers n, qn, \ qn, q(1≤n, q≤1051\le n ,\ q \le 10^51≤n, q≤105).
The second line contains $n$ integers a1, a2,…, ana_1, \ a_2, \dots , \ a_na1, a2,…, an(0≤ai≤10100 \le a_i \le 10^{10}0≤ai≤1010).
Each of the next $q$ lines contains three integers l,r,kl, r, kl,r,k(1≤l≤ r≤ n,1≤ k≤1051\le l \le \ r \le \ n, 1 \le \ k \le 10^51≤l≤ r≤ n,1≤ k≤105).
It's guaranteed that ∑n, ∑q ≤ 5× 105\sum n, \ \sum q \ \le \ 5 \times \ 10^5∑n, ∑q ≤ 5× 105

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

2
3 3
1 2 3
1 2 1
1 3 1
2 3 1
3 3
2 2 2
1 2 1
1 2 2
1 2 3

NO
YES
NO
YES
YES
NO