#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;

bool cmp(pii a, pii b) {
    if (a.second != b.second) return a.second < b.second;
    return a.first < b.first;
}

int main() {
    int n, w, d, z = 1003;
    pii a[2023] = {};
    cin >> n >> w >> d;
    for (int i = 1; i <= n; i++) {
        int x, y;
        char f;
        cin >> x >> y >> f;
        if (f == 'N') {
            a[i].first = x + y;
            a[i].second = x - y + d + d;
        } else if (f == 'E') {
            a[i].first = x - y + d + d;
            a[i].second = d + d + w + w - x - y;
        } else if (f == 'S') {
            a[i].first = d + d + w + w - x - y;
            a[i].second = d + d + w + w - x + y;
        } else {
            a[i].first = d + d + w + w - x + y;
            a[i].second = d + d + w + w + x + y;
        }
        //cout << a[i].first << ' ' << a[i].second << '\n';
        swap(a[i].first, a[i].second);
    }
    sort(a + 1, a + n + 1);
    for (int i = n + 1; i <= n + n; i++) a[i].first = a[i - n].first + d + d + w + w, a[i].second = a[i - n].second + d + d + w + w;
    //for (int i = 1; i <= n + n; i++) cout << a[i].second << ' ' << a[i].first << '\n';
    for (int i = 1; i <= n; i++) {
        int l = a[i].first, c = 1, l0 = l;
        //cout << l << ' ';
        for (int j = i + 1; j < i + n; j++) {
            if (a[j].second > l) {
                l = a[j].first;
                c++;
                //cout << l << ' ';
            }
        }
        //cout << c << '\n';
        z = min(z, c);
    }
    cout << z << '\n';
}
/*
 10 11 11
 4 1 N
 7 5 E
 10 1 E
 6 1 E
 7 3 N
 10 5 S
 5 5 S
 4 6 W
 9 9 E
 4 4 W

 11 11 11
 4 1 N
 7 5 E
 10 1 E
 6 1 E
 7 3 N
 10 5 S
 5 5 S
 4 6 W
 9 9 E
 4 4 W
 8 8 W
 */