A12929 | 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.

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$ .

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.