#include <bits/stdc++.h>

using namespace std;

char bin[][];

const int maxh = ;

const int maxw = ;

int H,W;

int pic[maxh][maxw],color[maxh][maxw];

char line[maxw];

const int dr[] = {-,,,};

const int dc[] = {,,-,};

///转成像素点图

void decode(char ch,int row,int col)

{

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

    {

        pic[row][col+i] = bin[ch][i] - '';

    }

}

void dfs(int row,int col,int c)

{

    color[row][col] = c;

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

    {

        int row2 = row + dr[i];

        int col2 = col + dc[i];

        if(row2>=&&row2<H&&col2>=&&col2<W&&pic[row2][col2]==pic[row][col]&&color[row2][col2]==)

        {

            dfs(row2,col2,c);

        }

    }

}

const char* code = "WAKJSD";

vector<set<int> > neighbors;

void check_neighbors(int row,int col)

{

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

    {

        int row2 = row + dr[i];

        int col2 = col + dc[i];

        if(row2>=&&row2<H&&col2>=&&col2<W&&pic[row2][col2]==&&color[row2][col2]!=)

        {

            neighbors[color[row][col]].insert(color[row2][col2]);

        }

    }

}

char recognize(int c)

{

    int cnt = neighbors[c].size();

    return code[cnt];

}

int main()

{

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

    strcpy(bin[''], "");

    strcpy(bin[''], "");

    strcpy(bin[''], "");

    strcpy(bin[''], "");

    strcpy(bin[''], "");

    strcpy(bin[''], "");

    strcpy(bin[''], "");

    strcpy(bin[''], "");

    strcpy(bin[''], "");

    strcpy(bin[''], "");

    strcpy(bin['a'], "");

    strcpy(bin['b'], "");

    strcpy(bin['c'], "");

    strcpy(bin['d'], "");

    strcpy(bin['e'], "");

    strcpy(bin['f'], "");

    int kase = ;

    while(scanf("%d%d",&H,&W),H) {

        memset(color,,sizeof(color));

        memset(pic,,sizeof(pic));

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

            scanf("%s",line);

            for(int j=;j<W;j++) {

                decode(line[j],i+,j*+);

            }

        }

        H+=;

        W = W*+;

        int cnt = ;

        vector<int> cc;

        memset(color,,sizeof(color));

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

            for(int j=;j<W;j++) {

                if(!color[i][j]) {

                    dfs(i,j,++cnt);

                    if(pic[i][j]==)

                        cc.push_back(cnt);

                }

            }

        }

        neighbors.clear();

        neighbors.resize(cnt+);

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

            for(int j=;j<W;j++) {

                if(pic[i][j] == )

                    check_neighbors(i,j);

            }

        }

        vector<char> ans;

        for(int i=;i<cc.size();i++)

            ans.push_back(recognize(cc[i]));

        sort(ans.begin(),ans.end());

        printf("Case %d: ",++kase);

        for(int i=;i<ans.size();i++)

            printf("%c",ans[i]);

        puts("");

    }

    return ;

}