#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
// #define endl '\n'
#define F first
#define S second
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (int)(x).size()


void tc() {
    int n, m, q;
    cin >> n >> m >> q;
    vector<string> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    vector<vector<int>> cols(m);
    vector<int> ans;
    //ans.reserve(n);
    for (int j = 0; j < m; j++) {
        int cnt = 0;
        vector<int> cur;
        for (int i = n - 1; i >= 0; i--) {
            if (a[i][j] == '.') continue;
            cur.push_back(n - i - 1 - cnt);
            ++cnt;
        }
        //ans.insert(ans.end(), cur.begin(), cur.end());
        for (auto x : cur)
            ans.push_back(x);
    }
    sort(all(ans));
    int maxq = 1e5 + 2;
    int ptr = 0;
    vector<int> b(maxq, 0);
    for (int i = 0; i < maxq; i++) {
        int cnt = 0;
        while (ptr < sz(ans) && ans[ptr] == i) {
            ++ptr;
            ++cnt;
        }
        if (i == 0) b[i] = cnt;
        else b[i] = b[i - 1] + cnt;
    }
    while (q--) {
        int x;
        cin >> x;
        cout << b[x] << endl;
    }
}

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