The first line contains a positive integer TTT (1≤T≤1061 \leq T \leq 10^61≤T≤106) , denoting the number of test cases. The first line of each test case contains two positive integers nnn and kkk (2≤n≤1062 \leq n \leq 10^62≤n≤106, 1≤k≤n1 \leq k \leq n1≤k≤n), indicating the length of the array aaa and the minimum distance of iii and jjj for each index selection. The second line consists of nnn non-negative integers aia_iai (0≤ai≤1090 \leq a_i \leq 10^90≤ai≤109).
It is guaranteed that 2≤∑n≤1062 \leq \sum n \leq 10^62≤∑n≤106.
For each test case, output one string per line, either "YES" or "NO" (without quotes), indicating whether it is possible or not.
5
5 2
3 0 5 1 3
6 3
5 0 0 3 0 0
5 5
1 2 3 4 5
6 1
0 0 1 0 0 1
7 2
1 1 0 1 1 1 1
YES
NO
NO
NO
YES