实现题，注意一些边界问题就好了
//
// GGGGGGGGGGGGG CCCCCCCCCCCCC AAA
// GGG::::::::::::G CCC::::::::::::C A:::A
// GG:::::::::::::::G CC:::::::::::::::C A:::::A
// G:::::GGGGGGGG::::G C:::::CCCCCCCC::::C A:::::::A
// G:::::G GGGGGG C:::::C CCCCCC A:::::::::A
//G:::::G C:::::C A:::::A:::::A
//G:::::G C:::::C A:::::A A:::::A
//G:::::G GGGGGGGGGGC:::::C A:::::A A:::::A
//G:::::G G::::::::GC:::::C A:::::A A:::::A
//G:::::G GGGGG::::GC:::::C A:::::AAAAAAAAA:::::A
//G:::::G G::::GC:::::C A:::::::::::::::::::::A
// G:::::G G::::G C:::::C CCCCCC A:::::AAAAAAAAAAAAA:::::A
// G:::::GGGGGGGG::::G C:::::CCCCCCCC::::C A:::::A A:::::A
// GG:::::::::::::::G CC:::::::::::::::C A:::::A A:::::A
// GGG::::::GGG:::G CCC::::::::::::C A:::::A A:::::A
// GGGGGG GGGG CCCCCCCCCCCCCAAAAAAA AAAAAAA
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
#include <ctime>
using namespace std;
#ifdef DEBUG
#define VAR(a,b) decltype(b) a=(b)
#define debug(...) printf("DEBUG: "),printf(__VA_ARGS__)
#define gettime() end_time=clock();printf("now running time is %.7f\\n",(float)(end_time - start_time)/CLOCKS_PER_SEC);
#else
#define VAR(a,b) __typeof(b) a=(b)
#define debug(...)
#define gettime()
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\
printf("%d ",dp[htx][hty]);}Pln();}
#define M 10005
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define FOR(a,b) for(VAR(a,(b).begin());a!=(b).end();++a)
#define eps 1e-6
clock_t start_time=clock(), end_time;
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int nx,ny,t,k;
struct turs{
int x,y;
}tur[M];
int mz[65][65];
bool check(int x,int y){
if(x>=nx||x<0||y>=ny||y<0)return false;
if(mz[x][y])return false;
return true;
}
void solve(){
char str[100];
while(k--){
int id;
scanf("%d %s",&id,str);
if(!strcmp(str,"W")){
int x=tur[id].x-1,y=tur[id].y;
if(check(x,y)){
mz[tur[id].x][tur[id].y]=0;
mz[x][y]=1;
tur[id].x=x;tur[id].y=y;
}
}else if(!strcmp(str,"E")){
int x=tur[id].x+1,y=tur[id].y;
if(check(x,y)){
mz[tur[id].x][tur[id].y]=0;
mz[x][y]=1;
tur[id].x=x;tur[id].y=y;
}
}else if(!strcmp(str,"N")){
int x=tur[id].x,y=tur[id].y-1;
if(check(x,y)){
mz[tur[id].x][tur[id].y]=0;
mz[x][y]=1;
tur[id].x=x;tur[id].y=y;
}
}else if(!strcmp(str,"S")){
int x=tur[id].x,y=tur[id].y+1;
if(check(x,y)){
mz[tur[id].x][tur[id].y]=0;
mz[x][y]=1;
tur[id].x=x;tur[id].y=y;
}
}else if(!strcmp(str,"NE")){
int x=tur[id].x+1,y=tur[id].y-1;
if(check(x,y)){
mz[tur[id].x][tur[id].y]=0;
mz[x][y]=1;
tur[id].x=x;tur[id].y=y;
}
}else if(!strcmp(str,"NW")){
int x=tur[id].x-1,y=tur[id].y-1;
if(check(x,y)){
mz[tur[id].x][tur[id].y]=0;
mz[x][y]=1;
tur[id].x=x;tur[id].y=y;
}
}else if(!strcmp(str,"SE")){
int x=tur[id].x+1,y=tur[id].y+1;
if(check(x,y)){
mz[tur[id].x][tur[id].y]=0;
mz[x][y]=1;
tur[id].x=x;tur[id].y=y;
}
}else if(!strcmp(str,"SW")){
int x=tur[id].x-1,y=tur[id].y+1;
if(check(x,y)){
mz[tur[id].x][tur[id].y]=0;
mz[x][y]=1;
tur[id].x=x;tur[id].y=y;
}
}
}
for(int i=0;i<ny;i++){
int to=-1;
for(int j=nx-1;j>=0;j--){
if(mz[j][i]){
to=j;
break;
}
}
for(int j=0;j<=to;j++){
putchar((mz[j][i])?'\*':' ');
}Pln();
}
}
int main() {
ios_base::sync_with_stdio(0);
while(~scanf("%d%d%d%d",&ny,&nx,&t,&k)){
Set(mz,0);
for(int i=0;i<t;i++){
int id;
scanf("%d",&id);
scanf("%d%d",&tur[id].y,&tur[id].x);
mz[tur[id].x][tur[id].y]=1;
}
solve();
Pln();
}
}