#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;

void solve()
{
    int n, m, q;
    cin >> n >> m >> q;
    vector<string> grid(n);
    for (auto& x : grid)
        cin >> x;

    vi cnt(m);
    const int MAX = 100005;
    vi res(MAX);
    for (int i = n - 1; i >= 0; --i)
    {
        for (int j = 0; j < m; ++j)
        {
            if (grid[i][j] == '*')
            {
                int tm = n - 1 - i - cnt[j];
                if (tm <= MAX)
                    res[tm]++;
                ++cnt[j];
            }
        }
    }

    for (int i = 1; i < MAX; ++i)
        res[i] += res[i-1];

    for (int i = 0; i < q; ++i)
    {
        int t;
        cin >> t;
        cout << res[t] << endl;
    }
}

int main()
{
    int t = 1;
    //cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}