//#include <bits/stdc++.h>
 
#include <iostream>
#include <algorithm>
 
#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <cstring>
#include <string>
#include <utility>
#include <array>
#include <complex>
#include <valarray>
 
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
 
 
using namespace std;
#define int long long
 
typedef long long ll;
typedef unsigned long long ull;
//typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> plli;
typedef pair<double, int> pdbi;
typedef pair<int,pii> pipii;
typedef pair<ll,pll> plpll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
typedef vector<vector<int>> mat;
 
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
 
const ll hmod1 = 999999937;
const ll hmod2 = 1000000000 + 9;
const int INF = 1<<30;
const ll INFLL = 1LL<<62;
const double EPS = 1e-12;
const ll mod = 1000000000 + 7;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const double pi = 3.141592653589793;
 
#define addm(X, Y) (X) = ((X) + ((Y) % mod) + mod) % mod
#define inside(y, x, h, w) (0 <= (y) && (y) < (h) && 0 <= (x) && (x) < (w)) ? true : false
 
//debug
#define DEBUG 
 
#define DUMPOUT cout
 
#ifdef DEBUG
#define dump(...) DUMPOUT<<#__VA_ARGS__<<" :["<<__FUNCTION__<<":"<<__LINE__<<"]"<<endl; DUMPOUT<<"    "; dump_func(__VA_ARGS__)
#else
#define dump(...) 
#endif
 
void dump_func() {DUMPOUT << endl;};
 
template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) == 0) DUMPOUT << " ";
    else DUMPOUT << ", ";
    dump_func(std::move(tail)...);
}
 
//ostream 
template<typename T> ostream& operator << (ostream& os, vector<T>& vec) {
    os << "["; for (int i = 0; i<vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : ", "); os << "]";
    return os;
}
 
template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& pair_var) {
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}
 
template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& map_var) {
    os << "[";
    for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
        os << "(" << itr->first << ", " << itr->second << ")"; itr++;  if(itr != map_var.end()) os << ", "; itr--;
    }
    os << "]";
    return os;
}
 
template<typename T> ostream& operator << (ostream& os, set<T>& set_var) {
    os << "[";
    for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
        os << *itr; ++itr; if(itr != set_var.end()) os << ", "; itr--;
    }
    os << "]";
    return os;
}

int n, k;
int x[100000 + 5], y[100000 + 5];
char c[100000 + 5];
bool white[100000 + 5];
vector<pair<int, pair<int, int>>> p; 
//int sum_w[1005][1005], sum_b[1005][1005];
int mcnt_wx[1005], mcnt_wy[1005], mcnt_bx[1005], mcnt_by[1005], ncnt_wx[1005], ncnt_wy[1005], ncnt_bx[1005], ncnt_by[1005];
int okcnt_w[1005][1005], okcnt_b[1005][1005], nocnt_w[1005][1005], nocnt_b[1005][1005];
int total_ok_w, total_ok_b;

signed main() {	
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n >> k;
    rep(i, n) {
        cin >> x[i] >> y[i] >> c[i];
        p.push_back({k - (x[i] % k), {k - (y[i] % k), i}});
        if ((x[i] / k) % 2 ==  (y[i] / k) % 2) {
            white[i] = true;
        }
        //if (white[i] && c[i] == 'W') match++;
        //if (!white[i] && c[i] == 'B') match++;
    }
    sort(all(p));
    //dump(p);
    int ans = 0;
    rep(l, 2) {
        if (l == 1) {
            rep(i, n) {
                //cout << i << " " << white[i] << endl;
                if (white[i]) white[i] = false;
                else white[i] = true;
                //cout << i << " " << white[i] << endl;
            }
            rep(i, 1005)rep(j, 1005) {
                mcnt_wx[i] = 0;
                mcnt_wy[i] = 0;
                mcnt_bx[i] = 0;
                mcnt_by[i] = 0;
                ncnt_wx[i] = 0;
                ncnt_wy[i] = 0;
                ncnt_bx[i] = 0;
                ncnt_by[i] = 0;
                okcnt_w[i][j] = 0;
                okcnt_b[i][j] = 0;
                nocnt_w[i][j] = 0;
                nocnt_b[i][j] = 0;
            }
            total_ok_w = 0;
            total_ok_b = 0;
        }
        rep(i, n) {
            pair<int, pair<int, int>> xyi = p[i];
            int kx = xyi.fi;
            int ky = xyi.se.fi;
            int idx = xyi.se.se;
            if (white[idx] && c[idx] == 'W') {
                //sum_w[kx][ky]++;
                total_ok_w++;
                mcnt_wx[kx]++;
                mcnt_wy[ky]++;
                okcnt_w[kx][ky]++;
            }
            else if (!white[idx] && c[idx] == 'B') {
                //sum_b[kx][ky]++;
                total_ok_b++;
                mcnt_bx[kx]++;
                mcnt_by[ky]++;
                okcnt_b[kx][ky]++;
            }
            else if (white[idx] && c[idx] == 'B') {
                ncnt_wx[kx]++;
                ncnt_wy[ky]++;
                nocnt_w[kx][ky]++;
            }
            else {
                ncnt_bx[kx]++;
                ncnt_by[ky]++;
                nocnt_b[kx][ky]++;
            }

        }
        rep(i, 1003) {
            mcnt_wx[i + 1] += mcnt_wx[i];
            mcnt_wy[i + 1] += mcnt_wy[i];
            mcnt_bx[i + 1] += mcnt_bx[i];
            mcnt_by[i + 1] += mcnt_by[i];
            ncnt_wx[i + 1] += ncnt_wx[i];
            ncnt_wy[i + 1] += ncnt_wy[i];
            ncnt_bx[i + 1] += ncnt_bx[i];
            ncnt_by[i + 1] += ncnt_by[i]; 
        }
        rep(i, 1002)rep(j, 1002) {
            okcnt_w[i + 1][j + 1] += okcnt_w[i + 1][j] + okcnt_w[i][j + 1] -  okcnt_w[i][j];
            okcnt_b[i + 1][j + 1] += okcnt_b[i + 1][j] + okcnt_b[i][j + 1] - okcnt_b[i][j];
            nocnt_w[i + 1][j + 1] += nocnt_w[i + 1][j] + nocnt_w[i][j + 1] - nocnt_w[i][j];
            nocnt_b[i + 1][j + 1] += nocnt_b[i + 1][j] + nocnt_b[i][j + 1] - nocnt_b[i][j];
        }
        rep(i, k)rep(j, k) {
           // cout << total_ok_w - mcnt_wx[i] - mcnt_wy[i]+ 2 * okcnt_w[i][j] + total_ok_b - mcnt_bx[i] - mcnt_by[i] + 2 * okcnt_b[i][j] + ncnt_wx[i] + ncnt_wy[i] - 2 * nocnt_w[i][j] + ncnt_bx[i] + ncnt_by[i] - 2 * nocnt_b[i][j] << endl;
            ans = max(ans, total_ok_w - mcnt_wx[i] - mcnt_wy[j]+ 2 * okcnt_w[i][j] + total_ok_b - mcnt_bx[i] - mcnt_by[j] + 2 * okcnt_b[i][j] + ncnt_wx[i] + ncnt_wy[j] - 2 * nocnt_w[i][j] + ncnt_bx[i] + ncnt_by[j] - 2 * nocnt_b[i][j]);
        }
    }
    cout << ans << endl;
}

Measured memory_bytes: 36848