You are given a row of N sweets each of which has one of N different colors. What is the minimum number of sweets you must remove so that no two sweets of one color are separated by a sweet of a different color?

The input test file will contain multiple test cases. Each input test case begins with a single line containing the integers N and K where 1 ≤ N ≤ 100 and 1 ≤ K ≤ 5. The next line contains N integers 1, …, N. each of which takes on values from the set {1, …, k}, representing the K different sweets colors. The end-of-file is marked by a test case with N = K = 0 and should not be processed.

For each input case, the program should the minimum number of sweets removed to satisfy the condition given in the problem.