Leader Wang gets lost when he is walking in NB school.Now,there are many brands in the road.There will include the direction in brand(East, South, West and North).NB school is the size of M * N,and leader will follow the direction in brand,like map1 and map2.Can leader walk out of the map?
Input until EOF.
First line contains two integets M(5<=M<=20) and N(5<=N<=20) indicates the size of school.
Next line contains two integets x(0<=x<M) and y(0<=y<N) indicates the starting position of leader.
Then M(from 0 to M-1) lines follows,each line contains N(from 0 to N-1) characters,every character(only is 'N' or 'S' or 'W' or 'E') indicates the direction in brand.
If leader can walk out of the map,output "YES",else output "NO".