CF1225B1.TV Subscriptions (Easy Version)

The only difference between easy and hard versions is constraints.

The BerTV channel every day broadcasts one episode of one of the $k$ TV shows. You know the schedule for the next $n$ days: a sequence of integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le k$), where $a_i$ is the show, the episode of which will be shown in $i$-th day.

The subscription to the show is bought for the entire show (i.e. for all its episodes), for each show the subscription is bought separately.

How many minimum subscriptions do you need to buy in order to have the opportunity to watch episodes of purchased shows $d$ ($1 \le d \le n$) days in a row? In other words, you want to buy the minimum number of TV shows so that there is some segment of $d$ consecutive days in which all episodes belong to the purchased shows.

简单版本与困难版本的唯一区别在于约束条件。

BerTV 频道每天播出 $k$ 部电视剧中某一部的一集。已知接下来 $n$ 天的播出计划：一个整数序列 $a_1, a_2, \dots, a_n$（其中 $1 \le a_i \le k$），$a_i$ 表示第 $i$ 天将播出的电视剧编号。

每部电视剧的订阅服务需为整部剧（即其所有剧集）单独购买，不同剧集的订阅相互独立。

为了能够连续 $d$（$1 \le d \le n$）天观看所订阅剧集的剧集，你至少需要购买多少部电视剧的订阅？换言之，你需要购买最少数量的电视剧，使得存在某个长度为 $d$ 的连续天数区间，该区间内每一天播出的剧集均属于你已订阅的剧集。

The first line contains an integer $t$ ($1 \le t \le 100$) — the number of test cases in the input. Then $t$ test case descriptions follow.

The first line of each test case contains three integers $n, k$ and $d$ ($1 \le n \le 100$, $1 \le k \le 100$, $1 \le d \le n$). The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le k$), where $a_i$ is the show that is broadcasted on the $i$-th day.

It is guaranteed that the sum of the values of $n$ for all test cases in the input does not exceed $100$.

第一行包含一个整数 $t$（$1 \le t \le 100$），表示输入中测试用例的数量。随后是 $t$ 个测试用例的描述。

每个测试用例的第一行包含三个整数 $n, k$ 和 $d$（$1 \le n \le 100$，$1 \le k \le 100$，$1 \le d \le n$）。第二行包含 $n$ 个整数 $a_1, a_2, \dots, a_n$（$1 \le a_i \le k$），其中 $a_i$ 表示第 $i$ 天播出的节目。

保证输入中所有测试用例的 $n$ 值之和不超过 $100$。

Print $t$ integers — the answers to the test cases in the input in the order they follow. The answer to a test case is the minimum number of TV shows for which you need to purchase a subscription so that you can watch episodes of the purchased TV shows on BerTV for $d$ consecutive days. Please note that it is permissible that you will be able to watch more than $d$ days in a row.

输出 $t$ 个整数——即按输入中测试用例的顺序给出的答案。每个测试用例的答案为：为确保能在 BerTV 上连续 $d$ 天观看所购电视节目的剧集，所需购买订阅的电视节目数量的最小值。请注意，你可能能够连续观看超过 $d$ 天。

In the first test case to have an opportunity to watch shows for two consecutive days, you need to buy a subscription on show $1$ and on show $2$. So the answer is two.

In the second test case, you can buy a subscription to any show because for each show you can find a segment of three consecutive days, consisting only of episodes of this show.

In the third test case in the unique segment of four days, you have four different shows, so you need to buy a subscription to all these four shows.

In the fourth test case, you can buy subscriptions to shows $3,5,7,8,9$, and you will be able to watch shows for the last eight days.

在第一个测试用例中，为了有机会连续两天观看节目，你需要购买节目 $1$ 和节目 $2$ 的订阅。因此答案为 $2$。

在第二个测试用例中，你可以购买任意一个节目的订阅，因为对每个节目，都存在一个仅由该节目的剧集组成的、长度为三天的连续时间段。

在第三个测试用例中，在唯一的一个四天时间段内，你拥有四个不同的节目，因此你需要购买这四个节目的全部订阅。

在第四个测试用例中，你可以购买节目 $3,5,7,8,9$ 的订阅，从而能够观看最后八天的节目。