#include <algorithm>
#include <cstdio>

#define MAX 8000000

using namespace std;

char f[MAX];
int pos = 0;

int dx[13] = {-2, -1, -1, -1, 0, 0, 0, 0, 0, 1, 1, 1, 2};
int dy[13] = {0, -1, 0, 1, -2, -1, 0, 1, 2, -1, 0, 1, 0};
pair<int, int> ox[1300005], oy[1300005];
int n, m, l = 0;
long long ans = 0;
pair<int, int> chidil;

void r(int &nr) {
    nr = 0;
    int sign = 1;
    while (f[pos] < '0' || f[pos] > '9') {
        if (f[pos] == '-')
            sign = 0;
        pos++;
    }
    while (f[pos] >= '0' && f[pos] <= '9')
        nr = nr * 10 + f[pos++] - '0';
    if (sign == 0)
        nr = -nr;
}

void rch(char &ch) {
    while (f[pos] < 'A' || f[pos] > 'Z')
        pos++;
    ch = f[pos];
    pos++;
}

int bs(pair<int, int> *v, pair<int, int> val) {
    int st = 1, dr = l, mid, last = 0;
    while (st <= dr) {
        mid = (st + dr) / 2;
        if (v[mid] <= val) {
            last = mid;
            st = mid + 1;
        } else
            dr = mid - 1;
    }
    return last;
}

pair<int, int> transform(pair<int, int> x) {
    pair<int, int> y;
    y.first = x.second;
    y.second = x.first;
    return y;
}

int main() {
    freopen("zc.in", "r", stdin);
    freopen("zc.out", "w", stdout);
    fread(f, 1, MAX, stdin);

    r(n);
    r(m);
    for (int i = 1; i <= n; i++) {
        int x, y;
        r(y);
        r(x);
        for (int j = 0; j < 13; j++) {
            l++;
            ox[l].first = x + dx[j];
            ox[l].second = y + dy[j];

            oy[l].second = x + dx[j];
            oy[l].first = y + dy[j];
        }
    }

    sort(ox + 1, ox + 1 + l);
    sort(oy + 1, oy + 1 + l);

    int laux = 0;
    for (int i = 1; i <= l; i++) {
        if (i == 1 || ox[i] != ox[i - 1]) {
            laux++;
            ox[laux] = ox[i];
        }
    }
    laux = 0;

    for (int i = 1; i <= l; i++) {

        if (i == 1 || oy[i] != oy[i - 1]) {

            laux++;

            oy[laux] = oy[i];
        }
    }

    l = laux;

    for (int i = 1; i <= m; i++) {
        pair<int, int> dest;
        char dir;
        int dist;
        rch(dir);
        r(dist);

        if (dir == 'S') {
            dest = chidil;
            dest.first -= dist;
            ans += bs(ox, chidil) - bs(ox, dest);
        } else if (dir == 'N') {
            dest = chidil;
            dest.first += dist;
            ans += bs(ox, dest) - bs(ox, chidil);

        } else if (dir == 'V') {
            dest = chidil;
            dest.second -= dist;
            ans += bs(oy, transform(chidil)) - bs(oy, transform(dest));
        } else {
            dest = chidil;
            dest.second += dist;
            ans += bs(oy, transform(dest)) - bs(oy, transform(chidil));
        }
        chidil = dest;
    }
    printf("%lld\n", ans);
    return 0;
}