// g++ macro.cpp -std=c++14
#include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using namespace std;

#define dump(x)  cout << #x << " = " << (x) << endl;
#define YES(n) cout << ((n) ? "YES" : "NO"  ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No"  ) << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE"  ) << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible"  ) << endl
#define possible(n) cout << ((n) ? "possible" : "impossible"  ) << endl

#define SANKOU(n,a,b) cout << ((n) ? (#a) : (#b) ) << endl

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)

#define FOREACH(x,a) for(auto& (x) : (a) )

#define WFA(d,v) REP(k,v)REP(i,v)REP(j,v)d[i][j]=min(d[i][j],d[i][k]+d[k][j])

#define SCOUT(x) cout<<(x)<<" "
#define ENDL cout<<endl

#define VECCIN(x) for(auto&youso_: (x) )cin>>youso_
#define VECIN2(x,y) REP(i,x.size())cin>>x[i]>>y[i]
#define VECCOUT(x) if(1){for(auto tt=x.begin();tt!=x.end();tt++){if(tt!=x.begin())cout<<" ";cout<<(*tt);}cout<<endl;}

#define ALL(obj) (obj).begin(),(obj).end()

#define EXIST(n,x) (find(ALL(n),x)!=n.end())
#define UNIQUE(obj) sort(ALL( obj )); obj.erase(unique(ALL(obj)),obj.end())
#define EN(x) if(1){cout<<#x<<endl;return 0;}
#define COUT(x) cout<<(x)<<endl
void CINT(){}
template <class Head,class... Tail>
void CINT(Head&& head,Tail&&... tail){
    cin>>head;
    CINT(move(tail)...);
}
#define CIN(...) int __VA_ARGS__;CINT(__VA_ARGS__)
#define LCIN(...) ll __VA_ARGS__;CINT(__VA_ARGS__)
#define SCIN(...) string __VA_ARGS__;CINT(__VA_ARGS__)

template <class T = ll>
T IN(){T x;cin>>x;return (x);}

template <class Head>
void VT(Head head){}
template <class Head,class Seco,class... Tail>
void VT(Head&& head,Seco&& seco,Tail&&... tail){
    seco.resize(head);
    VT(head,move(tail)...);
}
void VT2(){}
template <class Head,class... Tail>
void VT2(Head&& head,Tail&&... tail){
  VECCIN(head);
  VT2(move(tail)...);
}

template <class Head>
void VT3(Head&& head){}
template <class Head,class Seco,class... Tail>
void VT3(Head&& head,Seco&& seco,Tail&&... tail){
  seco[head]=IN();
  VT3(head,move(tail)...);
}

#define VC1(n,...) V __VA_ARGS__;VT(n,__VA_ARGS__);VT2(__VA_ARGS__); //aaabbbccc
#define VC2(n,...) V __VA_ARGS__;VT(n,__VA_ARGS__);REP(i,n)VT3(i,__VA_ARGS__); //abcabcabc

// #include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision; // cpp_int

#define P pair<int,int>
#define V vector<int>
#define M map<int,int>
#define S set<int>
#define PQ priority_queue<int>
#define PQG priority_queue<int,V,greater<int>>

#define str string

#define pb(a) push_back(a)
#define mp make_pair

class RectangleSum{//O(HW)で初期化してO(1)で長方形の和を出す(閉区間)
  public:
  vector<V> sum;
  RectangleSum(vector<V> v,int h,int w){
    sum=vector<V>(h,V(w,0));
    REP(i,h)
      REP(j,w){
        sum[i][j]=v[i][j];
        if(i>0)sum[i][j]+=sum[i-1][j];
        if(j>0)sum[i][j]+=sum[i][j-1];
        if(i>0&&j>0)sum[i][j]-=sum[i-1][j-1];
      }
  }
  ll getSum(int l,int r,int u,int d){//閉区間 第3,4引数が縦に対応してるので注意
    ll ret=sum[d][r];
    if(l>0)ret-=sum[d][l-1];
    if(u>0)ret-=sum[u-1][r];
    if(l>0&&u>0)ret+=sum[u-1][l-1];
    return ret;
  }
};

int main(){
  CIN(n,k);
  V x(n);V y(n);V c(n);
  REP(i,n){
    cin>>x[i]>>y[i];SCIN(s);
    c[i]=(s=="B");
    x[i]%=2*k;y[i]%=2*k;
  }
  vector<V> v(2*k,V(2*k,0));
  int def=count(ALL(c),0);
  REP(i,n)
    v[x[i]][y[i]]+=(c[i]?1:-1);
  //REP(i,2*k)VECCOUT(v[i]);
  RectangleSum rec(v,2*k,2*k);

  ll ans=0;
  REP(i,k)
    REP(j,k){
      ll val=0;
      val+=rec.getSum(i,i+k-1,j,j+k-1);
      val+=rec.getSum(i+k,k*2-1,j+k,k*2-1);
      if(i&&j)val+=rec.getSum(0,i-1,0,j-1);
      if(i)val+=rec.getSum(0,i-1,j+k,k*2-1);
      if(j)val+=rec.getSum(i+k,k*2-1,0,j-1);
      //dump(val);
      ans=max(ans,n-(val+def));
      ans=max(ans,val+def);
    }
  COUT(ans);


  return 0;
}


Measured memory_bytes: 49408