#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(int (i)=(a);(i)<(n);++(i))
#define eFOR(i,a,n) for(int (i)=(a);(i)<=(n);++(i))
#define rFOR(i,a,n) for(int (i)=(n)-1;(i)>=(a);--(i))
#define erFOR(i,a,n) for(int (i)=(n);(i)>=(a);--(i))
#define each(i, a) for(auto &i : a)
#define SORT(i) sort((i).begin(),(i).end())
#define rSORT(i,a) sort((i).begin(),(i).end(),(a))
#define all(i) (i).begin(),(i).end()
#define out(y,x) ((y) < 0 || h <= (y) || (x) < 0 || w <= (x))
#define line cout << "-----------------------------\n" 
#define ENDL(i,n) ((i) == (n) - 1 ? "\n" : " ")
#define stop system("pause") //comment out this on AOJ.
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr ld pi = 3.1415926535897932;
template<class T>inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T>inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& elemnt : v)is >> elemnt; return is; }
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }
template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }
template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }

template<class T> class acc2d {
    int h, w;
    vector<vector<T>> dat;
public:
    acc2d(const vector<vector<T>>& _dat) : dat(_dat), h(_dat.size()), w(_dat[0].size()) {
        FOR(i, 0, h)FOR(j, 1, w)dat[i][j] += dat[i][j - 1];
        FOR(i, 1, h)FOR(j, 0, w)dat[i][j] += dat[i - 1][j];
    }
    int sum(int y1, int x1, int y2, int x2) {
        int ret = dat[y2 - 1][x2 - 1];
        if (0 < y1)ret -= dat[y1 - 1][x2 - 1];
        if (0 < x1)ret -= dat[y2 - 1][x1 - 1];
        if (0 < y1 && 0 < x1)ret += dat[y1 - 1][x1 - 1];
        return ret;
    }
    int sum(int y2, int x2) { return sum(0, 0, y2, x2); }
};

int main() {
    init();

    int n, k; cin >> n >> k;
    auto b = vec<int>(k * 2, k * 2), w = b;
    FOR(i, 0, n) {
        int x, y; char c; cin >> x >> y >> c;
        x %= k * 2, y %= k * 2;
        if (c == 'B')++b[x][y];
        else ++w[x][y];
    }

    acc2d<int> bl(b), wh(w);
    int ans = 0;
    FOR(x, 0, k * 2)FOR(y, 0, k * 2) {
        int cnt = 0;

        //B
        if (x <= k && y <= k)cnt += bl.sum(x, y, x + k, y + k);
        else if (x <= k && k < y) {
            cnt += bl.sum(x, y, x + k, k * 2);
            cnt += bl.sum(x, 0, x + k, y - k);
        }
        else if (k < x && y <= k) {
            cnt += bl.sum(x, y, k * 2, y + k);
            cnt += bl.sum(0, y, x - k, y + k);
        }
        else {
            cnt += bl.sum(x, y, k * 2, k * 2);
            cnt += bl.sum(x, 0, k * 2, y - k);
            cnt += bl.sum(0, y, x - k, k * 2);
            cnt += bl.sum(0, 0, x - k, y - k);
        }
        (x += k) %= k * 2;

        //W
        if (x <= k && y <= k)cnt += wh.sum(x, y, x + k, y + k);
        else if (x <= k && k < y) {
            cnt += wh.sum(x, y, x + k, k * 2);
            cnt += wh.sum(x, 0, x + k, y - k);
        }
        else if (k < x && y <= k) {
            cnt += wh.sum(x, y, k * 2, y + k);
            cnt += wh.sum(0, y, x - k, y + k);
        }
        else {
            cnt += wh.sum(x, y, k * 2, k * 2);
            cnt += wh.sum(x, 0, k * 2, y - k);
            cnt += wh.sum(0, y, x - k, k * 2);
            cnt += wh.sum(0, 0, x - k, y - k);
        }
        (y += k) %= k * 2;

        //B
        if (x <= k && y <= k)cnt += bl.sum(x, y, x + k, y + k);
        else if (x <= k && k < y) {
            cnt += bl.sum(x, y, x + k, k * 2);
            cnt += bl.sum(x, 0, x + k, y - k);
        }
        else if (k < x && y <= k) {
            cnt += bl.sum(x, y, k * 2, y + k);
            cnt += bl.sum(0, y, x - k, y + k);
        }
        else {
            cnt += bl.sum(x, y, k * 2, k * 2);
            cnt += bl.sum(x, 0, k * 2, y - k);
            cnt += bl.sum(0, y, x - k, k * 2);
            cnt += bl.sum(0, 0, x - k, y - k);
        }
        (x += k) %= k * 2;

        //W
        if (x <= k && y <= k)cnt += wh.sum(x, y, x + k, y + k);
        else if (x <= k && k < y) {
            cnt += wh.sum(x, y, x + k, k * 2);
            cnt += wh.sum(x, 0, x + k, y - k);
        }
        else if (k < x && y <= k) {
            cnt += wh.sum(x, y, k * 2, y + k);
            cnt += wh.sum(0, y, x - k, y + k);
        }
        else {
            cnt += wh.sum(x, y, k * 2, k * 2);
            cnt += wh.sum(x, 0, k * 2, y - k);
            cnt += wh.sum(0, y, x - k, k * 2);
            cnt += wh.sum(0, 0, x - k, y - k);
        }
        (y += k) %= k * 2;

        chmax(ans, cnt);
    }

    cout << ans << "\n";
}

Measured memory_bytes: 63104