#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;

int main (){
  int m, k;

  while (cin >> m >> k){
    if (m == 0 && k == 0) break;
    VI stones (m);
    for (int i = 0; i < m; i++)
      cin >> stones[i];

    VVVI removals (m+1, VVI (k, VI (1<<k, m)));
    
    for (int color = 0; color < k; color++)
      for (int used = 0; used < (1 << k); used++)
	removals[0][color][used] = 0;
    
    for (int i = 1; i <= m; i++){
      for (int used = 0; used < (1<<k); used++){
	for (int new_color = 0; new_color < k; new_color++) if ((1 << new_color) & used){
	  
	  removals[i][new_color][used] = 
	    min (removals[i][new_color][used],
		 removals[i-1][new_color][used] + (stones[i-1] != new_color+1));

	  for (int old_color = 0; old_color < k; old_color++) if ((1 << old_color) & used){
	    if (old_color == new_color) continue;
	    
	    removals[i][new_color][used] = 
	      min (removals[i][new_color][used],
		   removals[i-1][old_color][used - (1 << new_color)] + (stones[i-1] != new_color+1));
	  }
	}
      }
    }
    
    int best = m;
    for (int color = 0; color < k; color++)
      for (int used = 0; used < (1 << k); used++)
	best = min (best, removals[m][color][used]);

    cout << best << endl;
  }
}