#include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define rep(i,n) for(int i=0;i<(int)(n);i++)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
//constexpr double eps = 1e-14; 
constexpr double eps = 1e-10; 
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/

int N,K;
int sum[2002][2002][2]; // 0 : W , 1 : B

int get(int d,int l,int u,int r,int k){
    if(d>u or l>r) return 0;
    assert(d>=0 and l>=0 and u<2*K and r<2*K);
    int ret = 0;
    ret += sum[u][r][k];
    if(d-1>=0 and l-1>=0) ret += sum[d-1][l-1][k];
    if(l-1>=0) ret -= sum[u][l-1][k];
    if(d-1>=0) ret -= sum[d-1][r][k];
    return ret;
}

int main(){
    cin >> N >> K;
    vector<ll> x(N),y(N);
    vector<int> c(N);
    rep(i,N){
        char cc = 0;
        cin >> x[i] >> y[i] >> cc;
        int xx = x[i] % (2*K);
        int yy = y[i] % (2*K);
        if(cc == 'B')c[i] = 1;
        else c[i]=0;
        sum[xx][yy][c[i]]++;
    }

    for(int k=0;k<2;k++){
        for(int i=0;i<2*K;i++){
            for(int j=0;j<2*K;j++){
                sum[i][j+1][k] += sum[i][j][k];
            }
        }
        for(int j=0;j<2*K;j++){
            for(int i=0;i<2*K;i++){
                sum[i+1][j][k] += sum[i][j][k];
            }
        }
    }

    int ans = -1;
    for(int i=0;i<=K;i++){
        for(int j=0;j<=K;j++){
            for(int c=0;c<2;c++){
                int cnt = 0;
                int k=i+K-1;
                int l=j+K-1;
                for(int dx=-1;dx<=1;dx++){
                    for(int dy=-1;dy<=1;dy++){
                        int sx = max(0,i+K*dx);
                        int sy = max(0,j+K*dy);
                        int ex = min(2*K-1,k+K*dx);
                        int ey = min(2*K-1,l+K*dy);
                        int tc;
                        if(abs(dx)+abs(dy) == 1) tc = c^1;
                        else tc = c;
                        cnt += get(sx,sy,ex,ey,tc);
                    }
                }
                ans = max(ans,cnt);
            }
        }
    }
    cout << ans << endl;
    return 0;

    cout << "White" << endl;
    rep(i,2*K){
        rep(j,2*K){
            cout << sum[i][j][0] << " ";
        }
        cout << endl;
    }
    cout << "Black" << endl;
    rep(i,2*K){
        rep(j,2*K){
            cout << sum[i][j][1] << " ";
        }
        cout << endl;
    }
}


Measured memory_bytes: 33536