#include <stdio.h>

#define POS2INT(x,y,z) ( ((x)<<12) | ((y)<<6) | (z) )

#define N (POS2INT(64,63,63))

#define BUG printf("%d",1/0);


int rank[N];
int parent[N];

int nComp;

void reset() {
  int i;
  for(i=0;i<N;i++) {
    rank[i] = 0;
    parent[i] = i;
  }
}

int find(int v) {
  int p,w = v ;
/*  printf("find %d: ",v); */
  while(parent[w]!=w) 
    w = parent[w];
  while(v!=w) {
    p = parent[v];
    parent[v] = w;
    v = p;
  }
/*  printf("%d\n",w); */
  return w;
}


int nJoins = 0;

void join(int a, int b) {
 /* printf("join %d %d\n",a,b); */
  nJoins++;
/*  a = find(a) ;
  b = find(b); */
  if(rank[a]>rank[b]) {
    parent[b] = a;
  } else if(rank[b] >rank[a]) {
    parent[a] = b;
  } else {
    parent[a] = b;
    rank[b] ++;
  }
}


int r,s,v;
int cost;


char XXXS[100];

char * readStr() {
  int c;
  char * q = XXXS;
  while((c=getchar())>=' ')
    *(q++) = (char) c;
  *q = 0;
/*printf("READSTR: %s\n",XXXS);*/
  return XXXS;
}

void readConns() {
  int k,i,j;
  int a,b;


  for(k=0 ; k<v ; k++) {
    if(k) {
      for(i=0;i<r;i++) {
        if(i) {
          while(getchar()!='\n')
            ;
        }
        for(j=0;j<s;j++) {
          switch(getchar()) {
            case 'o': 
              a = find(POS2INT(j,i,k-1));
              b = find(POS2INT(j,i,k));
              if(a!=b) {
                nComp--;
                join(a,b);
              }
            case '.':
              break;
            default:
              BUG
          }
          getchar();
        }
      }
      while(getchar()!='\n')
        ;
    }

    for(i=0;i<r;i++) {

      if(i) {
        /* radka |.|. */
        for(j=0;j<s;j++) {
          switch(getchar()) {
            case '|' : 
              a = find(POS2INT(j,i-1,k));
              b = find(POS2INT(j,i,k));
              if(a!=b) {
                join(a,b);
                nComp--;
              }

              break;
            case '.':
              break;
            default:
              BUG
          }
          getchar();
        }
      }

      /* radka *-*- */
      getchar();
      for(j=1;j<s;j++) {
        switch(getchar()) {
          case '-':
            a = find(POS2INT(j-1,i,k));
            b = find(POS2INT(j,i,k));
            if(a!=b) {
              nComp--;
              join(a,b);
            }
          case '.':
            break;
          default:
            BUG
            break;
        }
        getchar();
      }
      getchar();
    }
    while(getchar()!='\n')
      ;
  }
}

#if 0
 void tryHoriz() {
  int i,j,k;
  int a,b;

  for(i = 0 ; i<r; i++) {
    /* levo-prave */
    for(j=1;j<s;j++)
      for(k=0;k<v;k++) {
        a = find(POS2INT(j,i,k));
        b = find(POS2INT(j-1,i,k));
        if(a!=b) {
          join(a,b);
          cost++;
          if( (--nComp)==1)
            return;
        }

      }
    /* predo-zadni */
    for(j=0;j<s;j++)
      for(k=1;k<v;k++) {
        a = find(POS2INT(j,i,k));
        b = find(POS2INT(j,i,k-1));
        if(a!=b) {
          join(a,b);
          cost++;
          if( (--nComp)==1)
            return;
        }
      }
  }
}


void tryVert() {
  int i,j,k;
  int a,b;

  for(i=0;i<s;i++)
    for(j=0;j<v;j++)
      for(k=1;k<r;k++) {
        a = find(POS2INT(i,k,j));
        b = find(POS2INT(i,k-1,j));
        if(a!=b) {
          cost+=2;
          join(a,b);
          if( (--nComp) == 1)
            return;
        }

      }
}

#endif

void tryHoriz() {
  int i,j,k;
  int a,b;

  for(i = 0 ; i<v; i++) {
    /* levo-prave */
    for(j=1;j<s;j++)
      for(k=0;k<r;k++) {
        a = find(POS2INT(j,k,i));
        b = find(POS2INT(j-1,k,i));
        if(a!=b) {
          join(a,b);
          cost++;
          if( (--nComp)==1)
            return;
        }

      }
    /* predo-zadni */
    for(j=0;j<s;j++)
      for(k=1;k<r;k++) {
        a = find(POS2INT(j,k,i));
        b = find(POS2INT(j,k-1,i));
        if(a!=b) {
          join(a,b);
          cost++;
          if( (--nComp)==1)
            return;
        }
      }
  }
}


void tryVert() {
  int i,j,k;
  int a,b;

  for(i=1;i<v;i++)
    for(j=0;j<s;j++)
      for(k=0;k<r;k++) {
        a = find(POS2INT(j,k,i-1));
        b = find(POS2INT(j,k,i));
        if(a!=b) {
          cost+=2;
          join(a,b);
          if( (--nComp) == 1)
            return;
        }

      }
}


char xxxF[100];

  char * format(int i) {
    if(i>1000*1000)
      sprintf(xxxF,"%d,%d,%d",i/(1000*1000), (i%(1000*1000)) / 1000, i%1000);
    else if(i>1000)
      sprintf(xxxF,"%d,%d",i/1000,i%1000);
    else 
      sprintf(xxxF,"%d",i);
    return xxxF;
  }

int main() {
  char *p;

  while(1) {
    p = readStr();
    sscanf(p,"%d%d%d",&v,&r,&s);
    if(!v)
      break;
    reset();
    nComp = v*r*s;
    cost = 0;
    readConns();
    if(nComp==1) 
      printf("Budova je jiz dostatecne propojena.\n");
    else {
      tryHoriz();
      if(nComp>1)
        tryVert();
      printf("Ocekavana cena: %s,000 Kc\n",format(cost));
    }
  }

  return 0;
}