#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>

using namespace std;

inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v;}
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str();}

typedef vector<int> vi;
typedef vector<vi>  vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;

#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EACH(t,i,c) for(t::iretator i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,n-1)

const double EPS = 1e-10;

vvi field(102, vi(102, 0));

int dx[] = {0, 1, 0, -1,};
int dy[] = {1, 0, -1, 0,};

void dfs(int c, int x, int y) {
	field[y][x] = 0;
	REP(i, 4) {
		if(c == field[y+dy[i]][x+dx[i]]) {
			dfs(c, x+dx[i], y+dy[i]);
		}
	}
}

int main() {
	int H, W;

	while(cin >> H >> W, H) {
		string str;
		REP(i, H) {
			cin >> str;
			REP(j, W) {
				field[i+1][j+1] = str[j];
			}
		}

		int num = 0;
		FOR(i, 1, H) {
			FOR(j, 1, W) {
				if(field[i][j]) {
					dfs(field[i][j], j, i);
					num++;
				}
			}
		}

		cout << num << endl;
	}

	return 0;
}