#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[12525];

int cc[12525];
int v[12525];
int kk[12525];
char yo[3][4] = {"...","...","..."};

char ans[12525][3][4];

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]++;
  }
  vector<pii> V;
  REP(i,n)V.push_back(pii(c[i],i));

  srand(time(NULL));
  while(true){
    REP(i,n)REP(x,3)REP(y,3)ans[i][x][y]='.';
    random_shuffle(ALL(V));
    bool ok = true;
    REP(_i,n){
      int i = V[_i].second;
      int sum = 0;
      REP(j,3){
        int all = v[c[i]+j];
        int cnt = cc[c[i]+j];
        int num = all / cnt;
        if(kk[c[i]+j] < all%cnt){
          num++;
        }
        sum += num;
        kk[c[i]+j]++;
        REP(y,num)ans[i][y][j]='#';
      }
      if(sum==0){
        ok=false;
        break;
      }
    }
    if(!ok)continue;
    REP(i,n)REP(y,3)puts(ans[i][y]);
    break;
  }
  return 0;
}