bool DBG = false;
//#pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
//#include <boost/multiprecision/cpp_dec_float.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using ll = long long;
using ld = long double;
//using i128 = __int128_t;
//using bint = boost::multiprecision::cpp_int;
//using d1024 = boost::multiprecision::number<mp::cpp_dec_float<1024>>;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define IFOR(i,a,b) for(int i=((b)-1);i>=(a);--i)
#define RPT(i,a,b) for(int i=(a);i<((a)+(b));++i)
#define IRPT(i,a,b) for(int i=((a)+(b)-1);i>=(a);--i)
#define ALL(x) x.begin(),x.end()
#define RALL(x) x.rbegin(),x.rend()
#define fs first
#define sd second
#define couts(x) cout << (x) << (" ")
#define coutn(x) cout << (x) << ("\n")
//#define ncouts(x) numout(x),outst[outst_N++] = ' '
//#define ncoutn(x) numout(x),outst[outst_N++] = '\n'
//#define scouts(x) strout(x),outst[outst_N++] = ' '
//#define scoutn(x) strout(x),outst[outst_N++] = '\n'
#define dcouts(x) if(DBG) couts(x)
#define dcoutn(x) if(DBG) coutn(x)
#define endl "\n"
#define psb push_back
#define ppb pop_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define LBIT(x,a) (((x)>>(a))&1LL)
#define IBIT(x,a) (((x)>>(a))&1)
#define BCOUNT(x) (__builtin_popcount(x))
#define sorta(x) sort(ALL(x))
#define sortra(x) sort(RALL(x))
#define revall(x) reverse(ALL(x))
template<typename T> std::istream &operator>>(std::istream &is, std::vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T1, typename T2> std::istream &operator>>(std::istream &is, std::pair<T1,T2> &p){is >> p.first >> p.second; return is; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::deque<T> &vec){ os << "deque["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> std::ostream &operator<<(std::ostream &os, const std::map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> std::ostream &operator<<(std::ostream &os, const std::unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
/*
std::ostream &operator<<(std::ostream &os, const i128 nu){
  i128 co = nu;
  if(co==0){cout << '0';}
  else{
    string ous; if(co<0){cout<<'-'; co*=-1;}
    while(co){
      ous += (co%10)+'0';
      co /= 10;
    }
    reverse(ALL(ous));
    cout<<ous;
  }
  return os;
}
std::istream &operator>>(std::istream &is, i128 &nu){ string cs; cin >> cs; nu=0;int mn=1; for(auto &x:cs) { if(x!='-'){nu*=10;nu+=(x-'0');} else mn *= -1;} nu *= mn;  return is; }

*/


template<class T> using V = vector<T>;
template<class T> using V2 = V<V<T>>;
template<class T> using V3 = V<V2<T>>;
template<class T> using V4 = V<V3<T>>;


constexpr ll LINF = 1LL << 60;
constexpr int IINF = 1 << 28;
constexpr ll mod =  1'000'000'007;
//constexpr ll mod = 998244353;



void solve(){
  int n, k; cin >> n >> k;
  k *= 2;
  V3<int> hope(2,V2<int>(k, V<int>(k,0) ) );// b w
  
  
  FOR(i,0,n){
    ll x, y; char c; cin >> x >> y >> c;
    int nt = ((c=='W')?1:0);
    x %= k;
    y %= k;
    hope[nt][x][y]++;
  }
  
  V3<int> sum(2,V2<int>(k+2, V<int>(k+2,0) ) );
  FOR(r,0,2){
    FOR(i,0,k){
      FOR(j,0,k){
        sum[r][i+1][j+1] = sum[r][i+1][j] + hope[r][i][j];
      }
    }
  }
  FOR(r,0,2){
    FOR(i,0,k){
      FOR(j,0,k){
        sum[r][j+1][i+1] += sum[r][j][i+1];
      }
    }
  }
  int ans = 0;
  auto f = [&](int mode, int x1, int y1, int x2, int y2){
    int ret = 0;
    ret = sum[mode][x2][y2]+ sum[mode][x1][y1] - sum[mode][x1][y2] - sum[mode][x2][y1];
    return ret;
  };
  FOR(i,0,k/2){
    FOR(j,0,k/2){
      int g0 = 0, g1 = 0;
      //g0 = f(0,0,0,i,j)+f(0,i,j,k,k)+f(1,i,0,k,j)+f(1,0,j,i,k);
      g0 = f(0,i,j,i+k/2,j+k/2) + f(0,i+k/2,j+k/2,k,k) + f(0,0,0,i,j) + f(0,0,j+k/2,i,k)+f(0,i+k/2,0,k,j);
      g1 = f(1,i,j,i+k/2,j+k/2) + f(1,i+k/2,j+k/2,k,k) + f(1,0,0,i,j) + f(1,0,j+k/2,i,k)+f(1,i+k/2,0,k,j);
      //couts(g0); couts(sum[0][k][k]-g0); couts(g1); coutn(sum[1][k][k]-g1);
      g1 = sum[1][k][k]-g1;
      g0 += g1;
      g1 = n - g0;
      ans = max(g0,ans);
      ans = max(g1,ans);
    }
  }
  /*
  FOR(r,0,2){
    FOR(i,0,k+1){
      FOR(j,0,k+1){
        couts(sum[r][j][i]);
      }
      coutn("");
    }
    coutn("");
  }
  FOR(r,0,2){
    FOR(i,0,k){
      FOR(j,0,k){
        couts(hope[r][j][i]);
      }
      coutn("");
    }
    coutn("");
  }
  
  coutn( f(0,1,1,3,3) );*/
  cout<<ans;
}



int main(void){
  //std::cout << std::fixed << std::setprecision(20);
  cin.tie(0);
  ios::sync_with_stdio(false);
  solve();
  //printf("%s", outst);
  return 0;
}



Measured memory_bytes: 81876