#include <stdio.h>
#include <assert.h>

FILE * input;

char f[50][50];
int w,h;

int d, dc[50];

int readCase()
{
  int i,j;

  fscanf( input, " %d %d ", &w, &h);

  if (w==0 && h==0) return 0;

  for (i=0; i<h; i++)
    for (j=0; j<w; j++)
      fscanf( input, "%c ", &(f[i][j]));

  return 1;
}

int visit(int i, int j)
{
  int val;

  if (i<0 || i>=h || j<0 || j>=w || f[i][j]=='.') return 0;

  val = f[i][j]=='X'?1:0;
  f[i][j]='.';
  val+=visit(i+1, j) + visit(i,j+1) + visit(i-1,j) + visit(i,j-1);
  return val;
}

void deleteDot(int i, int j)
{
  if (i<0 || i>=h || j<0 || j>=w || f[i][j]!='X') return;

  f[i][j]='*';
  deleteDot(i+1,j);
  deleteDot(i-1,j);
  deleteDot(i,j+1);
  deleteDot(i,j-1);

}

void solveCase( int kase)
{
  int i,j,v, flag;

  for (i=0; i<h; i++)
    for (j=0; j<w; j++)
      if (f[i][j]=='X') {
	deleteDot(i,j);
	f[i][j]='X';
      }

  for (i=0, d=0; i<h; i++)
    for (j=0; j<w; j++)
      if ((v=visit(i,j))>0){
	dc[d++] = v;
	/*	printf(" got %d", v); */
      }

  printf("Throw %d\n", kase);
  for (flag=0, i=1; i<=6; i++)
    for (j=0; j<d; j++)
      if (dc[j]==i){
	if (flag) printf(" ");
	printf("%d", i);
	flag=1;
      }
  printf("\n\n");
}

int main()
{
  int kase = 0;

  input = fopen( "dice.in" , "r");
  assert( input != NULL);

  while (readCase()) solveCase(++kase);

  fclose(input);

  return 0;
}