#include <bits/stdc++.h>
using namespace std;

template <class T>
ostream& operator<<(ostream& out, const vector<T> &cont) {
    out << "[";
    for(const auto &x: cont) out << x<< ", ";
    out << "]";
    return out;
}

#define dmp(x) cerr << #x << " = " << x << endl
#define dmpn(x) cerr << #x << " = " << x <<"; "

#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
#define int long long

typedef long long ll;
typedef pair<int, int> pii;
typedef long double ld;


void solve() {
    int n,m,q;
    cin >> n >> m >> q;

    vector<vector<char>> a(n, vector<char>(m));

    for(int i=0; i<n ;i++){
        for(int j=0; j<m; j++){
            cin >> a[i][j];
        }
    }

    vector<int> ans(200000LL, 0LL);
    vector<vector<int>> dp(n, vector<int>(m, 0LL));
    for(int i=n-1; i>=0; i--){
        for(int j=0; j<m; j++){
            if(i != n-1)
                dp[i][j] = dp[i+1][j];
            if(a[i][j] == '.')
                dp[i][j]++;
            else
                ans[dp[i][j]]++;
        }
    }

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

    while(q--){
        int x;
        cin >> x;
        cout << ans[x] << '\n';
    }


}

int32_t main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);
    solve();
    return 0;
}