f[i+1][i][bin[h[i+1]]][h[i+1]]=1;

f[i+1][j+1][k][l]=min(f[i+1][j+1][k][l],f[i][j][k][l]);

f[i+1][j][k|bin[h[i+1]]][h[i+1]]=min(f[i+1][j][k|bin[h[i+1]]][h[i+1]],f[i][j][k][l]+(h[i+1]!=l));

for(int i=0;i<=k;++i)for(int j=0;j<bin[8];++j)for(int k=0;k<8;++k)if(f[n][i][j][k]!=f[0][0][0][0])Ans=min(Ans,f[n][i][j][k]+num[U^j]);

#include    <iostream>
#include    <cstdio>
#include    <cstdlib>
#include    <algorithm>
#include    <vector>
#include    <cstring>
#include    <queue>
#include    <complex>
#include    <stack>
#define LL long long int
#define dob double
#define FILE "4490"
using namespace std;const int N = 110;
int n,k,bin[10],h[N],f[N][N][1<<8][9],t,Ans,num[1<<8];inline int gi(){int x=0,res=1;char ch=getchar();while(ch>'9'||ch<'0'){if(ch=='-')res*=-1;ch=getchar();}while(ch<='9'&&ch>='0')x=x*10+ch-48,ch=getchar();return x*res;
}inline void Min(int &x,int y){if(x>y)x=y;
}inline void solve(int U=0){for(int i=1;i<=n;++i)U|=bin[h[i]=gi()-25];memset(f,127/3,sizeof(f));Ans=f[0][0][0][0];f[1][0][bin[h[1]]][h[1]]=1;for(int i=1;i<n;++i){f[i+1][i][bin[h[i+1]]][h[i+1]]=1;for(int j=0;j<=i && j<=k;++j)for(int k=0;k<bin[8];++k)for(int l=0;l<8;++l)if(f[i][j][k][l]!=Ans){Min(f[i+1][j+1][k][l],f[i][j][k][l]);Min(f[i+1][j][k|bin[h[i+1]]][h[i+1]],f[i][j][k][l]+(h[i+1]!=l));}}for(int i=0;i<=k;++i)for(int j=0;j<bin[8];++j)for(int k=0;k<8;++k)if(f[n][i][j][k]!=f[0][0][0][0])Min(Ans,f[n][i][j][k]+num[U^j]);printf("Case %d: %d\n\n",++t,Ans);
}int main()
{freopen(FILE".in","r",stdin);freopen(FILE".out","w",stdout);bin[0]=1;for(int i=1;i<10;++i)bin[i]=bin[i-1]*2;for(int i=1;i<bin[8];++i)num[i]=num[i/2]+(i&1);while((n=gi()) && (k=gi()))solve();fclose(stdin);fclose(stdout);return 0;
}