Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

dp

graph matchings

*2500

No tag edit access

The problem statement has recently been changed. View the changes.

×
F. Replace on Segment

time limit per test

3 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou are given an array $$$a_1, a_2, \dots, a_n$$$, where each element is an integer from $$$1$$$ to $$$x$$$.

You can perform the following operation with it any number of times:

- choose three integers $$$l$$$, $$$r$$$ and $$$k$$$ such that $$$1 \le l \le r \le n$$$, $$$1 \le k \le x$$$ and each element $$$a_i$$$ such that $$$l \le i \le r$$$ is different from $$$k$$$. Then, for each $$$i \in [l, r]$$$, replace $$$a_i$$$ with $$$k$$$.

In other words, you choose a subsegment of the array and an integer from $$$1$$$ to $$$x$$$ which does not appear in that subsegment, and replace every element in the subsegment with that chosen integer.

Your goal is to make all elements in the array equal. What is the minimum number of operations that you have to perform?

Input

The first line contains one integer $$$t$$$ ($$$1 \le t \le 100$$$) — the number of test cases.

Each test case consists of two lines:

- the first line contains two integers $$$n$$$ and $$$x$$$ ($$$1 \le x \le n \le 100$$$);
- the second line contains $$$n$$$ integers $$$a_1, a_2, \dots, a_n$$$ ($$$1 \le a_i \le x$$$).

Additional constraint on the input: the sum of $$$n$$$ over all test cases does not exceed $$$500$$$.

Output

For each test case, print one integer — the minimum number of operations you have to perform.

Example

Input

33 21 2 16 31 2 3 1 2 312 33 1 3 1 2 1 1 2 3 1 1 3

Output

1 2 2

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/17/2024 09:44:04 (l3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|