CF1851C.Tiles Comeback

Vlad remembered that he had a series of $n$ tiles and a number $k$. The tiles were numbered from left to right, and the $i$-th tile had colour $c_i$.

If you stand on the first tile and start jumping any number of tiles right, you can get a path of length $p$. The length of the path is the number of tiles you stood on.

Vlad wants to see if it is possible to get a path of length $p$ such that:

• it ends at tile with index $n$;
• $p$ is divisible by $k$
• the path is divided into blocks of length exactly $k$ each;
• tiles in each block have the same colour, the colors in adjacent blocks are not necessarily different.

For example, let $n = 14$, $k = 3$.

The colours of the tiles are contained in the array $c$ = [$\color{red}{1}, \color{violet}{2}, \color{red}{1}, \color{red}{1}, \color{gray}{7}, \color{orange}{5}, \color{green}{3}, \color{green}{3}, \color{red}{1}, \color{green}{3}, \color{blue}{4}, \color{blue}{4}, \color{violet}{2}, \color{blue}{4}$]. Then we can construct a path of length $6$ consisting of $2$ blocks:

$\color{red}{c_1} \rightarrow \color{red}{c_3} \rightarrow \color{red}{c_4} \rightarrow \color{blue}{c_{11}} \rightarrow \color{blue}{c_{12}} \rightarrow \color{blue}{c_{14}}$

All tiles from the $1$-st block will have colour $\color{red}{\textbf{1}}$, from the $2$-nd block will have colour $\color{blue}{\textbf{4}}$.

It is also possible to construct a path of length $9$ in this example, in which all tiles from the $1$-st block will have colour $\color{red}{\textbf{1}}$, from the $2$-nd block will have colour $\color{green}{\textbf{3}}$, and from the $3$-rd block will have colour $\color{blue}{\textbf{4}}$.

弗拉德记得自己有一排 $n$ 块瓷砖和一个数 $k$。瓷砖从左到右编号，第 $i$ 块瓷砖的颜色为 $c_i$。

若你站在第一块瓷砖上，并向右跳跃任意数量的瓷砖，便可得到一条长度为 $p$ 的路径。路径的长度即为你所站过的瓷砖数量。

弗拉德想知道：是否存在一条长度为 $p$ 的路径，满足以下条件：

• 路径终点为编号为 $n$ 的瓷砖；
• $p$ 能被 $k$ 整除；
• 该路径可被划分为若干个长度恰好为 $k$ 的连续块；
• 每个块内的所有瓷砖颜色相同；相邻块的颜色可以相同，也可以不同。

例如，设 $n = 14$，$k = 3$。

瓷砖颜色数组 $c$ = [$\color{red}{1}, \color{violet}{2}, \color{red}{1}, \color{red}{1}, \color{gray}{7}, \color{orange}{5}, \color{green}{3}, \color{green}{3}, \color{red}{1}, \color{green}{3}, \color{blue}{4}, \color{blue}{4}, \color{violet}{2}, \color{blue}{4}$]。那么我们可以构造一条长度为 $6$ 的路径，包含 $2$ 个块：

$\color{red}{c_1} \rightarrow \color{red}{c_3} \rightarrow \color{red}{c_4} \rightarrow \color{blue}{c_{11}} \rightarrow \color{blue}{c_{12}} \rightarrow \color{blue}{c_{14}}$

其中，第 $1$ 个块的所有瓷砖颜色均为 $\color{red}{\textbf{1}}$，第 $2$ 个块的所有瓷砖颜色均为 $\color{blue}{\textbf{4}}$。

在本例中，还可以构造一条长度为 $9$ 的路径：第 $1$ 个块的所有瓷砖颜色为 $\color{red}{\textbf{1}}$，第 $2$ 个块的所有瓷砖颜色为 $\color{green}{\textbf{3}}$，第 $3$ 个块的所有瓷砖颜色为 $\color{blue}{\textbf{4}}$。

The first line of input data contains a single integer $t$ ($1 \le t \le 10^4$) — the number of test cases.

The description of the test cases follows.

The first line of each test case contains two integers $n$ and $k$ ($1 \le k \le n \le 2 \cdot 10^5$)—the number of tiles in the series and the length of the block.

The second line of each test case contains $n$ integers $c_1, c_2, c_3, \dots, c_n$ ($1 \le c_i \le n$) — the colours of the tiles.

It is guaranteed that the sum of $n$ over all test cases does not exceed $2 \cdot 10^5$.

输入数据的第一行包含一个整数 $t$（$1 \le t \le 10^4$）——测试用例的数量。

随后是各测试用例的描述。

每个测试用例的第一行包含两个整数 $n$ 和 $k$（$1 \le k \le n \le 2 \cdot 10^5$）——分别为瓷砖序列的长度和块的长度。

每个测试用例的第二行包含 $n$ 个整数 $c_1, c_2, c_3, \dots, c_n$（$1 \le c_i \le n$）——表示各瓷砖的颜色。

保证所有测试用例中 $n$ 的总和不超过 $2 \cdot 10^5$。

For each test case, output on a separate line:

• YES if you can get a path that satisfies these conditions;
• NO otherwise.

You can output YES and NO in any case (for example, strings yEs, yes, Yes and YES will be recognized as positive response).

对于每个测试用例，在单独的一行上输出：

• 如果可以得到一条满足这些条件的路径，则输出 YES；
• 否则输出 NO。

YES 和 NO 的大小写不限（例如，字符串 yEs、yes、Yes 和 YES 均被视为肯定回答）。

In the first test case, you can jump from the first tile to the last tile;

The second test case is explained in the problem statement.

在第一个测试用例中，你可以从第一块瓷砖跳到最后一块瓷砖；

第二个测试用例已在题目描述中说明。