#include <iostream>
#include <set>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    size_t n, m, q;
    cin >> n >> m >> q;


    vector<vector<char>> field = vector<vector<char>>(n);
    for (auto &vec : field)
        vec.resize(m, '.');

    char c;
    for (size_t ni = 0; ni < n; ni++) {
        for (size_t mi = 0; mi < m; mi++) {
            cin >> c;
            field[ni][mi] = c;
        }

        cin >> skipws;
    }

    set<int> times = set<int>();

    vector<int> results = vector<int>(n);
    vector<int> temp = vector<int>(m, 0);
    int running_sum = 0;

    for (size_t i = 0; i < n; i++) {
        for (size_t x = 0; x < m; x++) {
            size_t index = i + temp[x];
            // cout << index << endl;
            while (index < field.size() && field[field.size() - index - 1][x] == '*') {
                temp[x]++;
                running_sum++;
                index++;
            }
        }

        results[i] = running_sum;
    }

    for (size_t i = 0; i < q; i++) {
        size_t time;
        cin >> time;
        time = min(time, n - 1);

        cout << results[time] << endl;
    }

    return 0;
}