#include <iostream>
#ifdef MBP
#include "stdc++.h"
#else
#include <bits/stdc++.h>
#endif

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define REP(i, n) for (long long int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP_R(i, n) for (long long int i = (n - 1); i >= 0; --i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((long long int)(x).size())
#define BIT(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());

#define INF INT_MAX
#define INFLL LLONG_MAX
#define PB push_back
#define MOD 1000000007LL
#define LSB(x) __builtin_ctzll(x)
#define MSB(x) 64LL - __builtin_clzll(x) - 1LL
#define MSBINT(x) 32LL - __builtin_clz(x)
#define BITCNT(x) __builtin_popcountll(x)

using namespace std;
using uif = uint_fast64_t;
using ll = long long int;
using vec = vector<ll>;
using mat = vector<vector<ll>>;
using pa = pair<ll, ll>;
using tTree = __gnu_pbds::tree<ll, __gnu_pbds::null_type, less<ll>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;

template <class T>
using PQ = priority_queue<T>;
template <class T>
using PQG = priority_queue<T, vector<T>, greater<T>>;

const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
const ll dx8[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy8[8] = {0, 1, 1, 1, 0, -1, -1, -1};

template <class T>
bool chmax(T &, const T &);
template <class T>
bool chmin(T &, const T &);

ll qp(ll a, ll b);
ll qp(ll a, ll b, ll mo);

ll mod_pow(ll, ll);
ll mod_add(ll, ll);
ll mod_mul(ll, ll);
ll mod_div(ll, ll);
void make_fact(ll);
void make_invfact(ll);
void init_fact();

ll combination(ll, ll);

#define FACSIZE 200002LL

ll invfac[FACSIZE];
ll fac[FACSIZE];

void printMat(mat &M)
{
  for (auto v : M)
  {
    for (auto x : v)
    {
      cout << x << " ";
    }
    cout << endl;
  }
}

void sum(mat &M, mat &ans)
{
  ll n = M.size();
  ll n2 = n;
  //mat ans(n2, vec(n2));

  ans[0][0] = M[0][0];
  for (ll i = 1; i < n2; i++)
    ans[0][i] = ans[0][i - 1] + M[0][i % n];
  for (ll i = 1; i < n2; i++)
    ans[i][0] = ans[i - 1][0] + M[i % n][0];

  for (ll i = 1; i < n2; i++)
  {
    for (ll j = 1; j < n2; j++)
    {
      ans[i][j] = ans[i - 1][j] + ans[i][j - 1] - ans[i - 1][j - 1] + M[i % n][j % n];
    }
  }

  //return ans;
}

ll valFunc(mat &M, pa pos, ll n)
{

  if (pos.first >= n && pos.second >= n)
  {
    //return M[pos.first - n][pos.second - n] + M[pos.first - n][n - 1] + M[n - 1][pos.second - n] - M[n - 1][n - 1];
    return M[pos.first - n][pos.second - n] + valFunc(M, make_pair(pos.first, n - 1), n) + valFunc(M, make_pair(n - 1, pos.second), n) - M[n - 1][n - 1];
  }
  else if (pos.first >= n)
  {
    return M[pos.first - n][pos.second] + M[n - 1][pos.second];
  }
  else if (pos.second >= n)
  {
    return M[pos.first][pos.second - n] + M[pos.first][n - 1];
  }
  else
  {
    return M[pos.first][pos.second];
  }
}

ll cntMat(mat &M, pa tl, pa br)
{
  ll n = M.size();
  if (tl.first == 0 && tl.second == 0)
  {
    //return M[br.first][br.second];
    return valFunc(M, br, n);
  }
  else if (tl.first == 0)
  {
    return valFunc(M, br, n) - valFunc(M, make_pair(br.first, tl.second - 1), n);
  }
  else if (tl.second == 0)
  {
    return valFunc(M, br, n) - valFunc(M, make_pair(tl.first - 1, br.second), n);
  }
  else
  {

    return valFunc(M, br, n) - valFunc(M, make_pair(br.first, tl.second - 1), n) - valFunc(M, make_pair(tl.first - 1, br.second), n) + valFunc(M, make_pair(tl.first - 1, tl.second - 1), n);
  }
}

int main(void)
{
  ll n, k;
  cin >> n >> k;
  vec X(n);
  vec Y(n);
  vector<char> C(n);
  REP(i, n)
  cin >> X[i] >> Y[i] >> C[i];

  vector<mat> board(2, mat(2 * k, vec(2 * k, 0)));

  REP(i, n)
  {
    auto c = C[i];
    auto a = Y[i] % (2 * k);
    auto b = X[i] % (2 * k);

    if (c == 'W')
      board[0][a][b]++;
    else
      board[1][a][b]++;
  }
  //auto WS = sum(board[0]);
  //auto BS = sum(board[1]);
  auto VS = vector<mat>(2, mat(2 * k, vec(2 * k, 0)));
  sum(board[0], VS[0]);
  sum(board[1], VS[1]);
  ll ans = 0;
  pa cand1;
  pa cand2;
  ll cid;

  //return 0;

  REP(i, 2 * k)
  {
    REP(j, 2 * k)
    {
      pa tl = make_pair(i, j);
      pa br = make_pair(i + k - 1, j + k - 1);
      //REP(bw, 2)
      //{
      ll cnt = 0;
      ll bw = 0;
      REP(a, 2)
      {
        REP(b, 2)
        {
          //cout << bw << " " << a << " " << b << endl;
          pa mtl = make_pair(tl.first + a * k, tl.second + b * k);
          pa mbr = make_pair(br.first + a * k, br.second + b * k);
          //cout << mtl.first << "-" << mtl.second << endl;
          //cout << mbr.first << "-" << mbr.second << endl;
          ll idx = (bw + a + b) % 2;
          auto val = cntMat(VS[idx], mtl, mbr);
          //cout << "val:" << val << endl;
          cnt += val;
        }
      }
      //cout << "sumcnt:" << cnt << endl;
      //chmax(ans, cnt);
      if (cnt > ans)
      {
        ans = cnt;
        cand1 = tl;
        cand2 = br;
        cid = bw;
      }
      //}
    }
  }

  cout << ans << endl;
  //cout << cand1.first << "," << cand1.second << endl;
  //cout << cand2.first << "," << cand2.second << endl;
  //cout << cid << endl;

  //printMat(board[0]);
  //cout << endl;
  //printMat(board[1]);
  //cout << endl;
  //printMat(VS[0]);
  //cout << endl;
  //printMat(BS);

  return 0;
}

template <class T>
bool chmax(T &a, const T &b)
{
  if (a < b)
  {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
  if (b < a)
  {
    a = b;
    return 1;
  }
  return 0;
}

ll qp(ll a, ll b)
{
  ll ans = 1LL;
  do
  {
    if (b & 1LL)
      ans = 1LL * mod_mul(ans, a) % MOD;
    a = 1LL * mod_mul(a, a) % MOD;
  } while (b >>= 1LL);
  return ans;
}
ll qp(ll a, ll b, ll mo)
{
  ll ans = 1LL;
  do
  {
    if (b & 1LL)
      ans = 1LL * (ans % mo) * (a % mo);
    a = 1LL * (a % mo) * (a % mo);
  } while (b >>= 1LL);
  return ans;
}

ll mod_pow(ll x, ll r)
{
  if (r == 0)
    return 1;
  else if (r == 1)
    return x % MOD;
  else if (r % 2 == 0)
  {
    ll t = mod_pow(x, r / 2) % MOD;
    return t * t % MOD;
  }
  else
  {
    ll t = mod_pow(x, r / 2) % MOD;
    ll k = t * t % MOD;
    return k * x % MOD;
  }
}
ll mod_add(ll a, ll b)
{
  return (a + b) % MOD;
}

ll mod_mul(ll a, ll b)
{
  return (a * b) % MOD;
}

ll mod_div(ll a, ll b)
{
  return mod_mul(a, mod_pow(b, MOD - 2));
}

void make_fact(ll n)
{
  fac[0] = 1;
  REP(i, n)
  {
    fac[i + 1] = mod_mul(fac[i], i + 1);
  }
}

void make_invfact(ll n)
{
  invfac[n] = mod_pow(fac[n], MOD - 2);
  REP_R(i, n)
  {
    invfac[i] = mod_mul(invfac[i + 1], i + 1);
  }
}

void init_fact()
{
  make_fact(FACSIZE - 1);
  make_invfact(FACSIZE - 1);
}

ll combination(ll n, ll c)
{

  return mod_mul(fac[n], mod_mul(invfac[c], invfac[n - c]));
}
///////////////fact
/*
  init_fact();
  //cout << fac[5] << endl;
  //cout << invfac[5] << endl;
  //cout << combination(8, 4) << endl;
  //cout << combination(31, 8) << endl;
  //*/
///////////////////


Measured memory_bytes: 158592