#include <bits/stdc++.h>
#ifdef LOCAL_DEBUG
#define DEBUG 1
#define CERR if(DEBUG) cerr
#define MACRO(_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,NAME,...) NAME
#define pr(...) CERR<<MACRO(__VA_ARGS__,pr10,pr9,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)<<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)
#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)
#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)
#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)
#define pr9(a,b,c,d,e,f,g,h,i) pr1(a)<<pr8(b,c,d,e,f,g,h,i)
#define pr10(a,b,c,d,e,f,g,h,i,j) pr1(a)<<pr9(b,c,d,e,f,g,h,i,j)
#define prArr(a){CERR<<(#a)<<"={";int i=0;for(auto t:(a))CERR<<(i++?", ":"")<<t;CERR<<"}"<<endl;}
#else
#define DEBUG 0
#define pr(...)
#define prArr(a)
#endif
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL<<60)+1e9; // ~ 1.15 * 1e18
const Int mod = (1e9)+7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int,Int>;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
template<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){return o<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}
template<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?" ":"")<<t;return o;}
template<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}
//INSERT ABOVE HERE

template<typename T>
class CumulativeSum2D{
public:
  Int h, w;
  vector<vector<T> > sum;
  CumulativeSum2D(){}
  CumulativeSum2D(vector<vector<T> > A){
    assert(A.size());
    h = A.size();
    w = A[0].size();
    sum.resize(h+1,vector<T>(w+1));
    for(Int i=1;i<=h;i++)
      for(Int j=1;j<=w;j++) sum[i][j] += sum[i][j-1] + A[i-1][j-1];

    for(Int j=1;j<=w;j++)
      for(Int i=1;i<=h;i++) sum[i][j] += sum[i-1][j];

  }

  //半開区間
  T get(Int x,Int y,Int X,Int Y){
    assert(x <= X && y <= Y);
    assert(0<=x && x<=w && 0<=X && x <= w);
    assert(0<=y && y<=h && 0<=Y && Y <= h);
    return sum[Y][X] - sum[y][X] - sum[Y][x] + sum[y][x];
  }
};


signed main(){
  srand((unsigned)time(NULL));
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);

  Int N, K;
  cin>>N>>K;
  vector<P> A(N);
  for(Int i=0;i<N;i++){
    Int x, y;
    char ch;
    cin>>x>>y>>ch;
    if(ch == 'B') y += K;
    x %= 2 * K;
    y %= 2 * K;
    A[i] = P(x, y);
  }

  vector<vector<_int> > cnt(4 * K, vector<_int>(4 * K));
  for(auto p:A){
    Int x, y; tie(x, y) = p;
    cnt[y + K + K][x + K + K]++;
  }

  CumulativeSum2D <_int> sum(cnt);
  auto query=[&](Int x, Int y){
    Int X = x + K;
    Int Y = y + K;
    Int H = cnt.size();
    Int W = cnt[0].size();
    Max<Int>(x, 0); Min<Int>(x, W);
    Max<Int>(y, 0); Min<Int>(y, H);
    Max<Int>(X, 0); Min<Int>(X, W);
    Max<Int>(Y, 0); Min<Int>(Y, H);
    return sum.get(x, y, X, Y);
  };

  Int ans = 0;
  for(Int i=0;i<=4 * K;i++)
    for(Int j=0;j< 4 * K;j++){
      Int cnt1 = query(j, i);
      Int cnt2 = query(j + K, i + K);
      Int cnt3 = query(j + 2 * K, i);
      Int cnt4 = query(j, i + 2 * K);
      Int cnt5 = query(j + 2 * K, i + 2 * K);
      Int cnt6 = query(j + 3 * K, i + K);
      Int cnt = cnt1 + cnt2 + cnt3 + cnt4 + cnt5 + cnt6;
      Max(ans, cnt);
    }
  cout<<ans<<endl;
  return 0;
}


Measured memory_bytes: 190336