Feeding Chicks

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX 50
#define in(X,Y) (~X&&~Y&&X<N&&Y<M)
#define DR(C) (C=='N'?0:C==69?1:C=='S'?2:3)
char c;
int g[MX][MX],sx[]={-1,0,1,0},sy[]={0,1,0,-1},N,M,x,y,E,Q,a,b,I;
void sim(int x,int y,int s,int E){
    a=0,b=1,I=0;
    while(~E--){
        ++g[x][y],x+=sx[s],y+=sy[s];
        if(!in(x,y))return;
        if(++I==b)I=0,b+=a,++a&=1,++s&=3;
    }
}
int main(void){
    IN(tt)F(tt){
        scanf("%d%d%d",&N,&M,&Q),CL(g,0);
        F(Q)scanf("%d%d %c%d",&x,&y,&c,&E),sim(x-1,y-1,DR(c),E);
        F(N)FF(M)printf("%d%c",g[i][j],j+1==M?10:32);
        puts("---");
    }
    return 0;
}