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

int n, m, q;

void calc_gaps(vector<set<int>> &a, vector<set<pair<int, int>>> &g) {
    for (int i = 0; i < m; i++) {
        int last = -1;
        int init = -1;
        for (int x : a[i]) {
            if (init == -1) init = x;

            if (last == -1 || last + 1 == x) {
                last = x;
                continue;
            }

            g[i].insert({init, last});
            init = last = x;
        }

        g[i].insert({init, last});
    }
}

void step(int &ph, int &gn, set<pair<int, int>>& g) {
    auto p = g.begin();
    if (p == g.end()) return;

    if (p->first == gn + ph) {
        ph += p->second - p->first + 1;
        g.erase(p);
    }

    gn++;
}

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

    vector<set<int>> a(m, set<int>());
    for (int i = 0; i < n; i++) {
        string s;
        cin >> s;

        for (int j = 0; j < m; j++) {
            if (s[j] == '*') a[j].insert(n - i - 1);
        }
    }

    vector<set<pair<int, int>>> g(m, set<pair<int, int>>());
    calc_gaps(a, g);

    vector<int> ph(m, 0), gn(m, 0);
    vector<int> steps(n + 2, 0);

    for (int i = 0; i < n + 2; i++) {
        for (int j = 0; j < m; j++) {
            step(ph[j], gn[j], g[j]);
            steps[i] += ph[j];
        }
    }

    for (int i = 0; i < q; i++) {
        int h; cin >> h;
        if (h >= n + 2) h = n + 1;
        cout << steps[h] << '\n';
    }
}

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

    solve();
}