#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;

// tourist set
template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << '\n'; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
// tourist set end

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; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,b) FOR(i, 0, b)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<'\n'
#define p2(s, t) cout << (s) << " " << (t) << '\n'
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << '\n'
#define p_yes() p("YES")
#define p_no() p("NO")
#define SZ(x) ((int)(x).size())
#define SORT(A) sort(ALL(A))
#define RSORT(A) sort(ALL(A), greater<ll>())
#define MP make_pair

void no(){p_no(); exit(0);}
void yes(){p_yes(); exit(0);}

const ll mod = 1e9 + 7;
const ll inf = 1e18;
const double PI = acos(-1);

// 2次元累積和
struct AccSum2D{
    VV Ac; // accumulate
    ll W;
    ll H;
    AccSum2D(VV &A){
      H = A.size();
      W = A[0].size();
      Ac.resize(H+1, VI(W+1));
      // indexを1つずらしてコピー
      rep(i, H){
        rep(j, W){
          Ac[i+1][j+1] = A[i][j];
        }
      }
      // 横に累積
      rep(i, H+1){
        rep(j, W){
          Ac[i][j+1] += Ac[i][j];
        }
      }
      // 縦に累積
      rep(x, W+1){
        rep(y, H){
          Ac[y+1][x] += Ac[y][x];
        }
      }
    }
    // 入力したAの0-indexで指定
    // sum of (a,b) to (c,d)
    // a, cはy方向
    // b, dはx方向
    ll sum(ll a, ll b, ll c, ll d){
      // 内部ではindexが1ずれる
      a++; b++; c++; d++;
      return Ac[c][d] - Ac[a-1][d] - Ac[c][b-1] + Ac[a-1][b-1];
    }
};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll N, K;
    cin >> N >> K;
    ll K2 = 2*K;

    VV A(4*K, VI(4*K));
    rep(i, N){
      ll x,y;cin>>x>>y;
      char c; cin>>c;
      if(c=='W') x+=K;
      x %= (2*K);
      y %= (2*K);
      A[y][x]++;
    }
    rep(i, K2){
      rep(j, K2){
        A[i+K2][j+K2] = A[i][j];
        A[i+K2][j   ] = A[i][j];
        A[i   ][j+K2] = A[i][j];
      }
    }

    AccSum2D Acc(A);

    ll ma = 0;
    rep(i, K2){
      rep(j, K2){
        ll a = Acc.sum(i, j, i+K-1, j+K-1);
        ll b = Acc.sum(i+K, j+K, i+K2-1, j+K2-1);
        chmax(ma, a+b);
      }
    }
    p(ma);
    
    return 0;
}

Measured memory_bytes: 250624