#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int MN = 25;
const int N = 107;
const int P = 8;
const int INF = 1e9;

template<typename T>
void updMin(T& a, T b)
{
	a = min(a, b);
}

int n, k;
int dp[N][P + 1][1 << P], ndp[N][P + 1][1 << P];

void solve()
{
	VI a(n);
	int full = 0;
	for (int& ai : a)
	{
		cin >> ai;
		ai -= MN;
		full |= 1 << ai;
	}
	FOR(j, 0, N)
		FOR(last, 0, P + 1)
			FOR(mask, 0, 1 << P)
				dp[j][last][mask] = INF;
	dp[0][P][full] = 0;
	FOR(i, 0, n)
	{
		FOR(j, 0, N)
			FOR(last, 0, P + 1)
				FOR(mask, 0, 1 << P)
					ndp[j][last][mask] = INF;
		FOR(j, 0, i + 1)
		{
			FOR(last, 0, P + 1)
			{
				FOR(mask, 0, 1 << P)
				{
					updMin(ndp[j][a[i]][mask & ~(1 << a[i])], dp[j][last][mask] + (last != a[i]));
					updMin(ndp[j + 1][last][mask], dp[j][last][mask]);
				}
			}
		}
		memcpy(dp, ndp, sizeof dp);
	}
	int ans = INF;
	FOR(j, 0, k + 1)
		FOR(last, 0, P + 1)
			FOR(mask, 0, 1 << P)
				updMin(ans, dp[j][last][mask] + __builtin_popcount(mask));
	cout << ans << "\n\n";
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	for (int tc = 1; ; tc++)
	{
		cin >> n >> k;
		if (n == 0 && k == 0)
			break;
		cout << "Case " << tc << ": ";
		solve();
	}
	return 0;
}