#include <bits/stdc++.h>

using namespace std;



int main() {
    int N, M, Q;
    cin >> N >> M >> Q;

    vector<vector<char>> v(N, vector<char>(M));

    for(auto& a: v)for(auto&b:a) cin>>b;

    vector<int> pileSize(100001, 0);
    reverse(v.begin(), v.end());

    for(int i = 0; i < M; i++) {
        int currPile = 0;
        for(int j = 0; j < N; j++) {
            if(v[j][i] == '*') {
                pileSize[j-currPile]++;
                currPile++;
            }
        }
    }
    for(int i = 1; i < pileSize.size(); i++) {
        pileSize[i] += pileSize[i-1];
    }

    int t;
    while(Q--) {
        cin >> t;
        cout << pileSize[t] << '\n';
    }


}