#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MAXN 15
int k,n,m,ans = 0,nx[6] = {1,-1,0,0,0,0},ny[6] = {0,0,1,-1,0,0},nz[6] = {0,0,0,0,1,-1},a,b;
char g[MAXN][MAXN][MAXN];
bool u[MAXN][MAXN][MAXN];
void dfs(int x,int y,int z){
	if(u[x][y][z]) return;
	ans++;
	u[x][y][z] = true;
	for(int i = 0;i < 6;i++)
		if(x + nx[i] >= 1 && x + nx[i] <= n && y + ny[i] >= 1 && y + ny[i] <= m && z + nz[i] >= 1 && z + nz[i] <= k && g[x + nx[i]][y + ny[i]][z + nz[i]] == '.')
			dfs(x + nx[i],y + ny[i],z + nz[i]);	
}
int main(){
	cin >> k >> m >> n;
	for(int i = 1;i <= k;i++) for(int j = 1;j <= n;j++) for(int z = 1;z <= m;z++) cin >> g[i][j][z];
	cin >> a >> b;
	dfs(a,b,1);
	cout << ans;
    return 0;
}