#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vii;

void solve(){
	int N, M,Q;
	cin >> N  >> M >> Q;
	vector<vector<char>> grid = vector(N,vector(M,'#'));

	for (int n = 0; n < N; ++n)
		for (int m = 0; m < M; ++m)
			cin >> grid[n][m];

	vector<int> times = vector(Q, 0);
	for (int q = 0; q < Q; ++q)
		cin >> times[q];

	vector<vector<int>> on_ground = vector(N,vector(M,-1));
	vector<vector<int>> spaces_before = vector(N,vector(M,0));

	for (int n = N-2; n >= 0; --n)
		for (int m = 0; m < M; ++m){
			spaces_before[n][m] = spaces_before[n+1][m] + (grid[n+1][m] == '.');
		}


	for (int n = 0; n < N; ++n)
		for (int m = 0; m < M; ++m)
			on_ground[n][m] = grid[n][m] == '*' ? spaces_before[n][m] : on_ground[n][m];

	vector<int> times_m = vector(200000, 0);
	for (const auto & row : on_ground){
		for (const auto & c : row){
			if (c >= 0) times_m[c]++;
		}
	}
	vector<int> times_prefix_sum = times_m;

	for (int i = 1; i < 200000; ++i){
		times_prefix_sum[i] += times_prefix_sum[i-1];
	}

	for (const auto & q : times){
		cout << times_prefix_sum[q] << "\n";
	}


}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    solve();

}