#include #include #define N 600 char c[N][N]; int p[N][N]; int w,h; int color; int smer[][2] = { {0,1},{1,0},{-1,0},{0,-1}}; int ret[N*N]; int farbi(int a, int b) { int i,px,py; p[a][b]=color; for ( i=0; i<4; i++ ) { px=a+smer[i][0]; py=b+smer[i][1]; if (px>=0 && px=0 && py=0 && px=0 && py0 && c[px][py]=='X') xfarbi(px,py); } return 0; } int int_cmp(const void *va, const void *vb) { return ( *(int *) va - *(int *) vb) ; } int main() { int i,j; while (1) { scanf("%d %d\n", &h, &w); if (w==0 && h==0) break; // printf("%d %d\n", w, h); for ( i=0; i0) { ret[p[i][j]-1]++; xfarbi(i,j); } qsort(&ret, color-1, sizeof(int), int_cmp); printf("Throw:"); for ( i=0; i