#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 9_ten + 7;

int main(){
  int n,k;
  cin >> n,k;
  vector<int> x(n), y(n);
  vector<string> c(n);
  for(int i=0; i<n; i++){
    cin >> x[i],y[i],c[i];
  }

  vector<vector<int>> b(3*k, vector<int>(3*k, 0));
  vector<vector<int>> w(3*k, vector<int>(3*k, 0));

  for(int i=0; i<n; i++){
    int xx = x[i] % (2*k);
    int yy = y[i] % (2*k);
    if( c[i] == "W" ){
      w[xx][yy]++;
      if( xx+2*k < 3*k ) w[xx+2*k][yy]++;
      if( yy+2*k < 3*k ) w[xx][yy+2*k]++;
      if( xx+2*k < 3*k && yy+2*k < 3*k ) w[xx+2*k][yy+2*k]++;
    }else if(c[i] == "B"){
      b[xx][yy]++;
      if( xx+2*k < 3*k ) b[xx+2*k][yy]++;
      if( yy+2*k < 3*k ) b[xx][yy+2*k]++;
      if( xx+2*k < 3*k && yy + 2*k < 3*k ) b[xx+2*k][yy+2*k]++;
    }else{
      abort();
    }
  }
  for(int dy=0; dy<3*k; dy++){
    for(int dx=0; dx<3*k; dx++){
      if(dy) b[dy][dx] += b[dy-1][dx];
      if(dx) b[dy][dx] += b[dy][dx-1];
      if(dy&&dx) b[dy][dx] -= b[dy-1][dx-1];

      if(dy) w[dy][dx] += w[dy-1][dx];
      if(dx) w[dy][dx] += w[dy][dx-1];
      if(dy&&dx) w[dy][dx] -= w[dy-1][dx-1];
    }
  }

  /* k*k
   (ay,ax) ---+
   |          |
   |          |
   +---------(by,bx)
  */
  auto get_cnt = [&](vector<vector<int>>& z, int by, int bx){
    int res = z[by][bx];
    if( by-k >= 0 ){
      res -= z[by-k][bx];
    }
    if( bx-k >= 0 ){
      res -= z[by][bx-k];
    }
    if( by-k >= 0 && bx-k >= 0 ){
      res += z[by-k][bx-k];
    }
    return res;
  };

  int ans = 0;
  for(int dy=0; dy<k; dy++){
    for(int dx=0; dx<k; dx++){
      { // b-w
        int tmp = 0;
        tmp += get_cnt(b, k-1+dy, k-1+dx);
        tmp += get_cnt(b, 2*k-1+dy, 2*k-1+dx);

        tmp += get_cnt(w, k-1+dy, 2*k-1+dx);
        tmp += get_cnt(w, 2*k-1+dy, k-1+dx);

        ans = max(tmp, ans);
      }
      { // b-w
        int tmp = 0;
        tmp += get_cnt(w, k-1+dy, k-1+dx);
        tmp += get_cnt(w, 2*k-1+dy, 2*k-1+dx);

        tmp += get_cnt(b, k-1+dy, 2*k-1+dx);
        tmp += get_cnt(b, 2*k-1+dy, k-1+dx);

        ans = max(tmp, ans);
      }
    }
  }

  println(ans);

  return 0;
}


Measured memory_bytes: 77056