#include #include #include using namespace std; int main(){ int n, m, q; cin >> n >> m >> q; vector S(n); for (int i = 0; i < n; i++){ cin >> S[i]; } vector A(n); vector Q(q); for (int i = 0; i < q; i++){ cin >> Q[i]; } for (int i = 0; i < m; i++){ int cur = 0; for (int k = 0; k < n; k++){ if (S[n-k-1][i] == '*'){ A[cur]++; } else cur++; } } vector Sum(n); int pre = 0; for(int i = 0; i < n; i++){ pre += A[i]; Sum[i] = pre; } for (int i = 0; i < q; i++){ cout << Sum[min(Q[i], n-1)] << endl; } }