#include <bits/stdc++.h>
const int N = 100005;
using namespace std;
map<pair<int, int>, bool> mp, visited;
int w[4][2] = {-1, -1, -1, 1, 1, -1, 1, 1};
set<int> sl[N * 2], sr[N * 2];
int n, m;
bool blk(int x, int y) { return mp.find(make_pair(x, y)) == mp.end(); }
bool vis(int x, int y) {
  return visited.find(make_pair(x, y)) != visited.end();
}
void nxtd(int &x, int &y, int &dir) {
  int xx, yy;
  xx = x + w[dir][0];
  yy = y + w[dir][1];
  bool r = blk(x, yy), c = blk(xx, y);
  if (r == c) {
    dir ^= 3;
    return;
  }
  if (r) {
    y = yy;
    dir ^= 2;
    return;
  }
  x = xx;
  dir ^= 1;
}
void nxt(int x, int y, int dir, int &nx, int &ny) {
  set<int>::iterator it;
  if (dir == 0) {
    it = sr[x - y + m + 1].lower_bound(x);
    it--;
    nx = *it;
    ++nx;
    ny = nx - x + y;
  } else if (dir == 1) {
    it = sl[x + y].lower_bound(x);
    it--;
    nx = *it;
    ++nx;
    ny = x + y - nx;
  } else if (dir == 2) {
    it = sl[x + y].lower_bound(x);
    nx = *it;
    --nx;
    ny = x + y - nx;
  } else {
    it = sr[x - y + m + 1].lower_bound(x);
    nx = *it;
    --nx;
    ny = nx - x + y;
  }
}
void ins(int x, int y) {
  mp[make_pair(x, y)] = true;
  sl[x + y].insert(x);
  sr[x - y + m + 1].insert(x);
}
char d0[5];
int main() {
  int k;
  scanf("%d%d%d", &n, &m, &k);
  int i, j, u, v;
  for (i = 0; i < k; i++) {
    scanf("%d%d", &u, &v);
    ins(u, v);
  }
  for (i = 0; i <= n + 1; i++) {
    ins(i, 0);
    ins(i, m + 1);
  }
  for (i = 1; i <= m; i++) {
    ins(0, i);
    ins(n + 1, i);
  }
  int x, y, d, nx, ny;
  scanf("%d%d", &x, &y);
  scanf("%s", d0);
  d = ((d0[0] == 'N') << 1) | (d0[1] == 'W');
  nxt(x, y, d, x, y);
  nxtd(x, y, d);
  long long ans = 0;
  int pd;
  bool fl = true;
  while (!vis(x, y)) {
    visited[make_pair(x, y)] = true;
    nxt(x, y, d, nx, ny);
    ans += abs(nx - x) + 1;
    x = nx;
    y = ny;
    visited[make_pair(x, y)] = true;
    pd = d;
    nxtd(x, y, d);
    if ((pd ^ d) == 3 && fl) {
      visited.clear();
      ans = 0;
      fl = false;
    }
  }
  printf("%I64d\n", ans);
  return 0;
}
