#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define vll vector<ll>
#define vvll vector<vll>
#define vpll vector<pair<ll, ll>>
#define pll pair<ll, ll>
#define rep(i, n) for(ll i = 0; i < (ll)n; i++)
#define fi first
#define se second

#define debug false

int main() {
    cin.tie(nullptr);
    cout.tie(nullptr);
    ios_base::sync_with_stdio(false);

//    freopen("./in.txt", "r", stdin);
//    freopen("./out.txt", "w", stdout);
//    cout << "COMMENT THIS OUT" << endl;

    ll N, M, Q;
    cin >> N >> M >> Q;
    vector<string> S(N);
    rep(i, N) {
        cin >> S[i];
    }

    vvll dp(N);
    rep(i, N){
        dp[i] = vector<ll>(M, 0);
    }

    vll point(M, N-1);

    rep(j, M){
        if(S[point[j]][j] == '.'){
//            point[j]--;
            continue;
        }
        while(point[j] >= 0 && S[point[j]][j] == '*'){
            point[j]--;
            dp[0][j]++;
        }
    }

    rep(iii, N - 1){
        ll t = iii + 1;
        rep(j, M){
            dp[t][j] = dp[t-1][j];
            point[j]--;
            while(point[j] >= 0 && S[point[j]][j] == '*'){
                point[j]--;
                dp[t][j]++;
            }
        }
    }

//    rep(i, N){
//        rep(j, M){
//            cout << dp[i][j] << " ";
//        }
//        cout << endl;
//    }

    vll sums(N, 0);
    rep(i, N){
        rep(j, M){
            sums[i] += dp[i][j];
        }
    }

    rep(i, Q) {
        ll T;
        cin >> T;

        if(T >= N-1) T = N-1;
        cout << sums[T] << endl;
    }

    return 0;
}