#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int MAXN = 523456;
const int INF = 2e9;
vector <pair <int, int> > linie, col;

int cod (ll val) {
  return (val + INF) % MAXN;
}

void baga (int x, int y) {
  if (x == 0 && y == 0)
    return;
  linie.push_back ({x, y});
  col.push_back ({y, x});
}

int cautax (int x, int y) {
	int st, dr, sol;
	st = 0;
	dr = col.size () - 1;
	sol = -1;
	pair <int, int> goal = {y, x};
	while (st <= dr) {
		int mij = (st + dr) / 2;
		if (col[mij].first < goal.first || (col[mij].first == goal.first && col[mij].second <= goal.second)) {
			st = mij + 1;
			sol = mij;
		}
		else
			dr = mij - 1;
	}
	return sol + 1;
}

int cautay (int y, int x) {
	int st, dr, sol;
	st = 0;
	dr = linie.size () - 1;
	sol = -1;
	pair <int, int> goal = {x, y};
	while (st <= dr) {
		int mij = (st + dr) / 2;
		if (linie[mij].first < goal.first || (linie[mij].first == goal.first && linie[mij].second <= goal.second)) {
			st = mij + 1;
			sol = mij;
		}
		else
			dr = mij - 1;
	}
	return sol + 1;
}

int findx (int x1, int x2, int y) {
	return cautax (x2, y) - cautax (x1 - 1, y);
}

int findy (int y1, int y2, int x) {
	return cautay (y2, x) - cautay (y1 - 1, x);
}

int main() {
  int n, m, i, x, y, val, xnou, ynou;
  ll sol;
  char c;
	freopen ("zc.in", "r", stdin);
	freopen ("zc.out", "w", stdout);
	scanf ("%d%d", &n, &m);
	for (i = 1; i <= n; i++) {
		scanf ("%d%d", &x, &y);
		swap (x, y);
		baga (x - 2, y);
		baga (x - 1, y - 1);
		baga (x - 1, y);
		baga (x - 1, y + 1);
		baga (x, y - 2);
		baga (x, y - 1);
		baga (x, y);
		baga (x, y + 1);
		baga (x, y + 2);
		baga (x + 1, y - 1);
		baga (x + 1, y);
		baga (x + 1, y + 1);
		baga (x + 2, y);
	}
	sort (linie.begin (), linie.end ());
  vector <pair <int, int> > v;
  v.push_back (linie[0]);
  for (unsigned j = 1; j < linie.size (); j++)
    if (linie[j] != linie[j - 1])
      v.push_back (linie[j]);
  linie = v;
  sort (col.begin (), col.end ());
  v.clear ();
  v.push_back (col[0]);
  for (unsigned j = 1; j < col.size (); j++)
    if (col[j] != col[j - 1])
      v.push_back (col[j]);
  col = v;

	sol = 0;
	x = 0; y = 0;
	scanf ("\n");
	//printf ("%d\n", linie[3].size ());
	for (i = 1; i <= m; i++) {
		scanf ("%c %d\n", &c, &val);
		if (c == 'N') {
			xnou = x + val;
			x++;
			sol += findx (x, xnou, y);
			x = xnou;
		}
		if (c == 'S') {
			xnou = x - val;
			x--;
			sol += findx (xnou, x, y);
			x = xnou;
		}
		if (c == 'E') {
			ynou = y + val;
			y++;
			sol += findy (y, ynou, x);
			y = ynou;
		}
		if (c == 'V') {
			ynou = y - val;
			y--;
			sol += findy (ynou, y, x);
			y = ynou;
		}
		//printf ("%lld\n", sol);
		//printf ("%d %d\n", x, y);
	}
	printf ("%lld\n", sol);
	return 0;
}