#include <vector>
#include <iostream>
#include <cassert>
using namespace std;

#define ll long long
class BinaryIndexed {
public:
	vector<ll> a;
	void init(vector<ll>& arr) {
		a.resize(arr.size()+1);
		a[0] = 0;
		a[1] = arr[0];
		for (int i=1; i<arr.size(); i++) {
			a[i+1] = a[i] + arr[i];
		}
		for (int i=a.size()+1; i>=1; i--) {
			ll prev = a[i-(i&-i)];
			a[i] = a[i] - prev;
		}
	}

	ll get(int k) {
		k++;
		ll res = 0;
		while (k >= 1) {
			res += a[k];
			k -= k & -k;
		}
		return res;
	}
};

int main() {
	int n, m, q; scanf("%d %d %d", &n, &m, &q);
	vector<vector<bool>> dp(n, vector<bool>(m));
	for (int i=0; i<n; i++) {
		char c;
		for (int j=0; j<m; j++) {
			scanf(" %c ", &c);
			dp[n-i-1][j] = c == '*';
		}
	}

	vector<ll> cnts(n, 0);
	for (int i=0; i<m; i++) {
		int sum = 0;
		for (int j=0; j<n; j++) {
			int cnt = 0, o_j = j;
			while (j < n && dp[j][i]) {
				cnt++;
				j++;
			}
			assert(o_j >= sum);
			cnts[o_j-sum] += cnt;
			// printf("i: %d, o_j: %d, sum: %d, adding: %d\n", i, o_j, sum, cnt);
			sum += cnt;
		}
	}

	BinaryIndexed st;
	st.init(cnts);
	while (q--) {
		int t; scanf("%d", &t);
		printf("%d\n", st.get(min(t, n-1)));
	}
}