/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author majk
 */

#ifndef MAJK_LIB
#define MAJK_LIB

#include <vector>
#include <stack>
#include <iostream>
#include <unordered_map>
#include <map>
#include <iomanip>
#include <set>
#include <functional>
#include <fstream>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <string>
#include <sstream>
#include <queue>
#include <bitset>
using namespace std;

#define x first
#define y second
typedef std::pair<int,int> pii; typedef long long ll; typedef unsigned long long ull; typedef unsigned int ui; typedef pair<ui,ui> puu;

template <typename T, typename U> std::istream&operator>>(std::istream&i, pair<T,U>&p) {i >> p.x >> p.y; return i;}
template<typename T>std::istream&operator>>(std::istream&i,vector<T>&t) {for(auto&v:t){i>>v;}return i;}
template<typename T>std::ostream&operator<<(std::ostream&o,const vector<T>&t) {if(t.empty())o<<'\n';for(size_t i=0;i<t.size();++i){o<<t[i]<<" \n"[i == t.size()-1];}return o;}
template<typename T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template<typename T> using maxheap = priority_queue<T, vector<T>, less<T>>;
auto fraclt = [](const pii&a,const pii&b) { return (ll)a.x * b.y < (ll)b.x * a.y; };
struct cmpfrac { bool operator()(const pii&a,const pii&b)const { return (ll)a.x * b.y < (ll)b.x * a.y; }};
template <typename T> bool in(T a, T b, T c) { return a <= b && b < c; }
ui logceil(int x) { return 8*sizeof(int)-__builtin_clz(x); }

namespace std {
    template<typename T,typename U>struct hash<pair<T,U>>{hash<T>t;hash<U>u;size_t operator()(const pair<T,U>&p)const{return t(p.x)^(u(p.y)<<7);}};
}
template<typename T,typename F>T bsh(T l,T h,const F&f){T r=-1,m;while(l<=h){m=(l+h)/2;if(f(m)){l=m+1;r=m;}else{h=m-1;}}return r;}
template<typename F> double bshd(double l,double h,const F&f,double p=1e-9){ui r=3+(ui)log2((h-l)/p);while(r--){double m=(l+h)/2;if(f(m)){l=m;}else{h=m;}}return (l+h)/2;}
template<typename T,typename F>T bsl(T l,T h,const F&f){T r=-1,m;while(l<=h){m=(l+h)/2;if(f(m)){h=m-1;r=m;}else{l=m+1;}}return r;}
template<typename F> double bsld(double l,double h,const F&f,double p=1e-9){ui r=3+(ui)log2((h-l)/p);while(r--){double m=(l+h)/2;if(f(m)){h=m;}else{l=m;}}return (l+h)/2;}
template<typename T> T gcd(T a,T b) { if (a<b) swap(a,b); return b?gcd(b,a%b):a; }

template<typename T>class vector2:public vector<vector<T>>{public:vector2(){} vector2(size_t a,size_t b,T t=T()):vector<vector<T>>(a,vector<T>(b,t)){}};
template<typename T>class vector3:public vector<vector2<T>>{public:vector3(){} vector3(size_t a,size_t b,size_t c,T t=T()):vector<vector2<T>>(a,vector2<T>(b,c,t)){}};
template<typename T>class vector4:public vector<vector3<T>>{public:vector4(){} vector4(size_t a,size_t b,size_t c,size_t d,T t=T()):vector<vector3<T>>(a,vector3<T>(b,c,d,t)){}};
template<typename T>class vector5:public vector<vector4<T>>{public:vector5(){} vector5(size_t a,size_t b,size_t c,size_t d,size_t e,T t=T()):vector<vector4<T>>(a,vector4<T>(b,c,d,e,t)){}};
template <typename T> struct bounded_priority_queue {
	inline bounded_priority_queue(ui X) : A(X), B(0) {}
	inline void push(ui L, T V) { B = max(B, L); A[L].push(V); }
	inline const T &top() const { return A[B].front(); }
	inline void pop() { A[B].pop(); while (B > 0 && A[B].empty()) --B; }
	inline bool empty() const { return A[B].empty(); }
	inline void clear() { B = 0; for (auto &a: A) a = queue<T>(); }
private:
	vector<queue<T>> A; ui B;
};


#endif
// #include "../l/mod.h"

class D {
public:
    int N,K;

    int sum(int x1, int x2, int y1, int y2, const vector2<int> &P) {
        if (x1 > 2*K) x1 %= 2*K;
        if (x2 > 2*K) x2 %= 2*K;
        if (y1 > 2*K) y1 %= 2*K;
        if (y2 > 2*K) y2 %= 2*K;
        if (x2 == x1) return 0;
        if (y2 == y1) return 0;
        if (x2 < x1) {
            return sum(x1, 2*K, y1, y2, P) + sum(0, x2, y1, y2, P);
        } else if (y2 < y1) {
            return sum(x1, x2, y1, 2*K, P) + sum(x1,x2, 0,y2,P);
        } else {
            return P[x2][y2] - P[x2][y1] - P[x1][y2] + P[x1][y1];
        }
    }

    void solve(istream& cin, ostream& cout) {
        cin >> N; cin >> K;
        int WW=0,BB=0;
        vector2<int> W(2*K,2*K,0), B(2*K,2*K,0), PW(2*K+1,2*K+1,0), PB(2*K+1,2*K+1,0);
        for (int i = 0; i < N; ++i) {
            int x,y; char c; cin >> x >> y >> c;
            x %= (2*K);
            y %= (2*K);
            if (c=='W') {
                ++WW; W[x][y]++;
            } else {
                ++BB; B[x][y]++;
            }
        }

        for (int i = 0; i < 2*K; ++i) {
            for (int j = 0; j < 2*K; ++j) {
                PW[i+1][j+1] = W[i][j] + PW[i+1][j] + PW[i][j+1] - PW[i][j];
                PB[i+1][j+1] = B[i][j] + PB[i+1][j] + PB[i][j+1] - PB[i][j];
            }
        }
//
        int ans = 0;
        for (int i = 0; i < K; ++i) {
            for (int j = 0; j < 2 * K; ++j) {
                int wCorrect = sum(i, i+K, j, j+K, PW) + sum(i+K,i,j+K,j, PW);
                int bCorrect = sum(i, i+K, j+K, j, PB) + sum(i+K,i,j,j+K, PB);
                ans = max(ans, wCorrect+bCorrect);
            }
        }
        cout << ans << endl;
    }
};


int main() {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
	D solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
	solver.solve(in, out);
    return 0;
}


Measured memory_bytes: 65152