#include <bits/stdc++.h>
using namespace std;
int n, m, k;
int a[30][30][30];
int sam;
void dfs(int i, int j, int l) {
	sam++;
	a[i][j][l] = 0;
	if (a[i + 1][j][l])
		dfs(i + 1, j, l);
	if (a[i - 1][j][l])
		dfs(i - 1, j, l);
	if (a[i][j + 1][l])
		dfs(i, j + 1, l);
	if (a[i][j - 1][l])
		dfs(i, j - 1, l);
	if (a[i][j][l + 1])
		dfs(i, j, l + 1);
	if (a[i][j][l - 1])
		dfs(i, j, l - 1);
	return;
}
int main() {
	cin >> n >> m >> k;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			for (int l = 1; l <= k; l++) {
				char x;
				cin >> x;
				if (x == '.')
					a[i][j][l] = 1;
			}
	int q, w;
	cin >> q >> w;
	dfs(1, q, w);
	cout << sam;
	return 0;
}