#include <iostream>
#include <algorithm>
#include <stdio.h>
using namespace std;

int n,m,k;
char g[11][11][15];

int dir[6][3]={{1,0,0},{-1,0,0},{0,1,0},{0,-1,0},{0,0,1},{0,0,-1}};

int flood(int l, int r, int c) {
	if (g[l][r][c]!='.') return 0;
	g[l][r][c]='W';
	int st=1;
	for (int d=0;d<6;d++) {
		int l2=l+dir[d][0], r2=r+dir[d][1], c2=c+dir[d][2];
		if (l2<=0 || l2>k || r2<=0 || r2>n || c2<=0 || c2>m) continue;
		st+=flood(l2,r2,c2);
	}
	return st;
}

int main() {
	scanf("%d %d %d",&k,&n,&m);
	for (int l=1;l<=k;l++) {
		for (int i=1;i<=n;i++) scanf("%s",g[l][i]+1);
	}
	int r0,c0;
	scanf("%d %d",&r0,&c0);
	printf("%d\n",flood(1,r0,c0));
    return 0;
}