#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector <int> v[1005][1005];
int check(int x)
{
return x * (x + 1) / 2;
}
int main(){
int n, m, y, x;
string s;
cin >> n >> m >> y >> x;
cin >> s;
for (int i = 0; i < s.size(); i++)
{
v[x][y].push_back(i + 1);
if (s[i] == 'N') x++;
if (s[i] == 'S') x--;
if (s[i] == 'W') y--;
if (s[i] == 'E') y++;
if (x < 1 || x > n || y < 1 || y > n)
{
return 0;
}
}
for (int i = n; i >= 1; i--)
{
for (int j = 1; j <= n; j++)
{
v[i][j].push_back(s.size() + 1);
int ans = 0, now = 0;
for (int k = 0; k < v[i][j].size(); k++)
{
ans += check(v[i][j][k] - now -1);
now = v[i][j][k];
}
printf("%d ", ans);
}
printf("\n");
}
return 0;
}