#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef pair<ld, ld> pdd;
#define vec vector
#define For(i, a, n) for(ll i=(ll)a;i<n;i++)
#define all(x) begin(x), end(x)
#define sz(x) (ll)size(x)

template<class A, class B>
pair<A,B>operator+(const pair<A, B>&a, const pair<A,B>&b){
    return {a.first + b.first, a.second + b.second};
}
template<class A, class B>
ostream&operator<<(ostream&os, const pair<A, B>&c){
    return os<<"("<<c.first<<", "<<c.second<<")";
}
template<class A, class B, class C>
basic_ostream<A,B>&operator<<(basic_ostream<A, B>&os, const C&c){
    for(auto itr=begin(c);itr!=end(c);++itr){
        os<<(itr==begin(c)?"":" ")<<*itr;
    }
    return os;
}
template<typename...Args>
void dbg(Args&&...args){
    ((cerr<<args<<" |"),...);cerr<<endl;
}


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

    vec<string> v(n);
    For(i, 0, n) cin >> v[i];

    vec<ll> time;

    For(i, 0, m)
    {
        ll p = 0;
        for(ll j = n-1; j >=0; j--)
        {
            if(v[j][i] == '*')
            {
                time.push_back((n-j)-p-1);
                p++;
            }
        }
    }

    sort(all(time));

    vec<pll> Q;
    For(i, 0, q){
        ll x;
        cin >> x;
        Q.push_back({x, i});
    }

    // dbg(time);
    // dbg(Q);

    sort(all(Q));
    vec<ll> ans(q);
    ll i = 0;
    time.push_back(12345678);
    For(j, 0, q) {
        while(time[i] <= Q[j].first) i++;
        ans[Q[j].second] = i;
        // dbg(Q[j].second, i);
    }

    // dbg(ans);

    For(i, 0, q) cout << ans[i] << '\n';
}

int main(){
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    int t = 1;
    while(t--)solve();
    return 0;
}