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

#define X first
#define Y second

int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};

string board[1005];
int canExtend[1005][1005];
int num[10];
int area[10];
queue<tuple<int,int,int>> q[10];
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n,m,s; 
    cin >> n >> m >> s;
    for(int i=1; i<=s; i++) {
        cin >> num[i];
    }
    for(int i=0; i<n ;i++) {
        cin >> board[i];
    }
    for(int i=0; i<n; i++) {
        for(int j=0; j<m; j++) {
            if(board[i][j]=='.') canExtend[i][j]=1;
            else if(board[i][j]=='#') canExtend[i][j]=0;
            else {
                canExtend[i][j]=0;
                q[board[i][j]-'0'].push({i,j,0});
                area[board[i][j]-'0']+=1;
            }

        }
    }
    while(1) {
        int isExtend=0;
        for(int i=1; i<=s; i++) {
            queue<tuple<int,int,int>> nxtq;
            while(!q[i].empty()) {
                int x,y,dist;
                tie(x,y,dist)=q[i].front(); q[i].pop();
                if(dist==num[i]) {
                    nxtq.push({x,y,0});
                    continue;
                }
                for(int idx=0; idx<4; idx++) {
                    int nx=x+dx[idx];
                    int ny=y+dy[idx];
                    if(nx<0 || nx>=n || ny<0 || ny>=m) continue;
                    if(!canExtend[nx][ny]) continue;
                    q[i].push({nx,ny,dist+1});
                    canExtend[nx][ny]=0;
                    area[i]++;
                    isExtend=1;
                }
            }
            q[i]=nxtq;
        }
        if(!isExtend) break;
    }
    for(int i=1; i<=s; i++) {
        cout << area[i] <<' ';
    }
    return 0;
}