#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <ctime>
#include <vector>
#include <queue>
#include <bitset>
#include <cmath>
#include <time.h>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stdlib.h>
#include <deque>
#include <iomanip>
#include <complex>
//#include <ext/rope>

using namespace std;
//using namespace __gnu_cxx;

//defines
typedef long long ll;
typedef long double ld;
#define TIME clock() * 1.0 / CLOCKS_PER_SEC
#define fast_read cin.sync_with_stdio(0)
#define PREX(number) cout << fixed << setprecision(number)
#define nul point(0, 0)
#define random srand(time(NULL))
#define rand_int abs((rand() << 15) | rand())
#define str_to_int(stroka) atoi(stroka.c_str())
#define str_to_ll(stroka) atoll(stroka.c_str())
#define str_to_double(stroka) atof(stroka.c_str())
#define what_is(x) cerr << #x << " is " << x << endl
#define solve_system int number; cin >> number; forn(i, 0, number) solve()
#define solve_system_scanf int number; scanf("%d", &number); forn(i, 0, number) solve()

//easy functions
template< typename T >
T gcd(T a, T b) { return a ? gcd(b % a, a) : b; }
template< typename T >
T lcm(T a, T b) { return (a / gcd(a, b)) * b; }
bool is_down(char x) { return ('a' <= x && x <= 'z'); }
bool is_upper(char x) { return ('A' <= x && x <= 'Z'); }
bool is_digit(char x) { return ('0' <= x && x <= '9'); }

//constants
const ld pi = 3.141592653589793238462643383279;
const ld log23 = 1.58496250072115618145373894394781;
const ld eps = 1e-8;
const ld zero = 0;
const ll INF = 1e18;
const int COUT = 30;
const int prost = 239;
const ll prost64 = 239;
const int two = 2;
const int thr = 3;
const ll sr = 31;
const int MOD = 1e9 + 7;
const int BIG = 2 * 1e9 + 1;
const int alf = 26;
const int MAX_N = 2 * 1e5 + 10;
const int MAX_M = 2011;
const int MAX_T = (1 << 20);
const int BLOCK = trunc(sqrt(MAX_N)) + 1;
const int MAX_LOG = 19;
const int km = (1 << 18);
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, 1, 0, -1};
const int dxo[8] = {-1, -1, -1, 0, 1, 1, 1, 0};
const int dyo[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
const int bit_max = 32;
const int dig = 10;
const string str_alf = "abcdefghijklmnopqrstuvwxyz";
const string str_alf_big = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const int day[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int digarr[10] = {6, 2, 5, 5, 4, 5, 6, 3, 7, 6};
const int bt = 31;

// Code starts here

int n, k, x[MAX_N], y[MAX_N], c[MAX_N], a[two][MAX_M][MAX_M], kol[two][MAX_M][MAX_M];

int gett(int d, int x1, int y1, int x2, int y2)
{
    return (kol[d][x2 + 1][y2 + 1] - kol[d][x1][y2 + 1] - kol[d][x2 + 1][y1] + kol[d][x1][y1]);
}

int main()
{   /*
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif /**/
    fast_read;
    cin >> n >> k;
    for (int i = 0; i < n; i++)
    {
        char kk;
        cin >> x[i] >> y[i] >> kk;
        x[i] %= (2 * k);
        y[i] %= (2 * k);
        if (kk == 'B')
            c[i] = 0;
        else
            c[i] = 1;
        a[c[i]][x[i]][y[i]]++;
    }
    memset(kol, 0, sizeof(kol));
    for (int d = 0; d < 2; d++)
        for (int i = 1; i <= 2 * k; i++)
            for (int j = 1; j <= 2 * k; j++)
                kol[d][i][j] = (kol[d][i - 1][j] + kol[d][i][j - 1] - kol[d][i - 1][j - 1] + a[d][i - 1][j - 1]);
    int ans = 0;
    for (int x = 0; x < k; x++)
        for (int y = 0; y < k; y++)
        {
            vector<int> xx, yy;
            xx.push_back(0);
            xx.push_back(x);
            xx.push_back(x + k);
            xx.push_back(2 * k);
            yy.push_back(0);
            yy.push_back(y);
            yy.push_back(y + k);
            yy.push_back(2 * k);
            sort(xx.begin(), xx.end());
            sort(yy.begin(), yy.end());
            xx.resize(unique(xx.begin(), xx.end()) - xx.begin());
            yy.resize(unique(yy.begin(), yy.end()) - yy.begin());
            int now = 0;
            for (int tx = 0; tx < (int)xx.size() - 1; tx++)
                for (int ty = 0; ty < (int)yy.size() - 1; ty++)
                    now += gett((tx + ty) & 1, xx[tx], yy[ty], xx[tx + 1] - 1, yy[ty + 1] - 1);
            ans = max(ans, now);
            now = 0;
            for (int tx = 0; tx < (int)xx.size() - 1; tx++)
                for (int ty = 0; ty < (int)yy.size() - 1; ty++)
                    now += gett((tx + ty + 1) & 1, xx[tx], yy[ty], xx[tx + 1] - 1, yy[ty + 1] - 1);
            ans = max(ans, now);
        }
    cout << ans;
    return 0;
}


Measured memory_bytes: 65792