#include <iostream>

 #include <cstdio>

 #include <cmath>

 #include <vector>

 #include <cstring>

 #include <string>

 #include <algorithm>

 #include <string>

 #include <set>

 #include <functional>

 #include <numeric>

 #include <sstream>

 #include <stack>

 #include <map>

 #include <queue>

 #define CL(arr, val)    memset(arr, val, sizeof(arr))

 #define ll long long

 #define inf 0x7f7f7f7f

 #define lc l,m,rt<<1

 #define rc m + 1,r,rt<<1|1

 #define pi acos(-1.0)

 #define L(x)    (x) << 1

 #define R(x)    (x) << 1 | 1

 #define MID(l, r)   (l + r) >> 1

 #define Min(x, y)   (x) < (y) ? (x) : (y)

 #define Max(x, y)   (x) < (y) ? (y) : (x)

 #define E(x)        (1 << (x))

 #define iabs(x)     (x) < 0 ? -(x) : (x)

 #define OUT(x)  printf("%I64d\n", x)

 #define lowbit(x)   (x)&(-x)

 #define Read()  freopen("a.txt", "r", stdin)

 #define Write() freopen("dout.txt", "w", stdout);

 #define maxn 1000000000

 #define N 110

 using namespace std;

 char filed[N][N];

 int w,h,sum;

 int dir[][]={-,,,,,,,-};

 void dfs(int x,int y,char c)

 {

     for(int i=;i<;i++)

     {

         int xx=x+dir[i][];

         int yy=y+dir[i][];

         if(xx>=&&xx<h&&yy>=&&yy<w&&filed[xx][yy]==c)

         {

             filed[xx][yy]='.';

             dfs(xx,yy,c);

         }

     }

 }

 int main()

 {

     //freopen("a.txt","r",stdin);

     while(~scanf("%d%d",&h,&w)&&w+h)

     {

         getchar();

         for(int i=;i<h;i++)

             scanf("%s",filed[i]);

         sum=;

         for(int i=;i<h;i++)

             for(int j=;j<w;j++)

             if(filed[i][j]!='.')

             {

                 dfs(i,j,filed[i][j]);

                 filed[i][j]='.';

                 sum++;

             }

         //printf("%d %d\n",a,b);

         printf("%d\n",sum);

     }

    return ;

 }