#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

int h,w,n;
char s[12525][12525];
int c[35353];

int cc[12525];
int v[12525];
int kk[12525];

int tmp[35353][3];

int main(){
  scanf("%d%d%d",&h,&w,&n);
  REP(i,h)scanf("%s",s[i]);
  REP(i,n)scanf("%d",c+i);
  REP(i,w){
    REP(j,h)if(s[j][i]=='#')v[i]++;
  }
  REP(i,n){
    REP(j,3)cc[c[i]+j]++;
  }

  REP(x,w){
    vector<pair<pii,int>> V;
    REP(i,n){
      if(c[i]<=x && x<=c[i]+2){
        int sum = tmp[i][0]+tmp[i][1]+tmp[i][2];
        V.push_back(make_pair(pii(sum,c[i]),i));
      }
    }
    sort(ALL(V));
    for(auto P:V){
      int i = P.second;
      int all = v[x];
      int cnt = cc[x];
      int num = all / cnt;
      if(kk[x] < all%cnt){
        num++;
      }
      kk[x]++;
      tmp[i][x-c[i]] = num;
    }
  }

  REP(i,n){
    REP(y,3){
      REP(x,3)if(tmp[i][x]>0){
        putchar('#');
        tmp[i][x]--;
      }else{
        putchar('.');
      }
      putchar('\n');
    }
  }
  return 0;
}