#include<stdio.h>
#include<cstring>
char map[60][60];  //记录地图的
char order[1005]; //记录方向的
int m, n, t;
bool f[60][60][1005];  //查重的
char diction[8];void dfs(int a,int b,int cur)
{if(cur == t){map[a][b] = '*';return ;}if(f[a][b][cur] != 0)return ;f[a][b][cur] = 1;     //这个地方千万别忘写了查重用的   没有这个一定超时if(order[cur] == 'N'){while((a - 1) >= 0&&map[a - 1][b] != 'X'){a--;dfs(a,b,cur + 1);}}else if(order[cur] == 'S'){while((a + 1) < n&&(map[a + 1][b] != 'X')){a++;dfs(a,b,cur + 1);}}else if(order[cur] == 'W'){while((b - 1) >= 0&&map[a][b - 1] != 'X'){b--;dfs(a,b,cur + 1);}}else if(order[cur] == 'E'){while((b + 1) < m&&map[a][b + 1] != 'X'){b++;dfs(a,b,cur + 1);}}
}
int main(){int i,j;scanf("%d%d",&n,&m);for(i = 0;i < n;i++){scanf("%s",map[i]);}scanf("%d",&t);for(j = 0;j < t;j++){scanf("%s",diction);order[j] = diction[0];}for(i = 0;i < n;i++){for(j = 0;j < m;j++){if(map[i][j] == '*')break;}if(j != m)break;}map[i][j] = '.';             //这个地方也是非常重要 起点一定要化成.不然也会wrong answermemset(f, 0, sizeof(f));dfs(i,j,0);for(i = 0;i < n;i++){for(j = 0;j < m;j++){printf("%c",map[i][j]);}printf("\n");}return 0;
}