#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
int n,k,X[200001],Y[200001],C[200001];
int A[1001][1001][2],B[1001][1001][2]={0};
int main(){
    char c;
    cin>>n>>k;
    rep(i,n){
        cin>>X[i]>>Y[i]>>c;
        C[i]=(c=='B');
    }
    rep(i,n) C[i]=(X[i]/k+Y[i]/k+C[i])%2,X[i]%=k,Y[i]%=k;
    rep(i,n) A[X[i]][Y[i]][C[i]]++;
    rep(i,k)rep(j,k)rep(k,2) B[i+1][j+1][k]=B[i][j+1][k]+B[i+1][j][k]-B[i][j][k]+A[i][j][k];
    int ans=0;
    rep(i,k)rep(j,k){
        int a=B[i][j][0]-B[0][0][0];
        a+=B[k][k][0]-B[i][k][0]-B[k][j][0]+B[i][j][0];
        a+=B[i][k][1]-B[i][j][1];
        a+=B[k][j][1]-B[i][j][1];
        ans=max({ans,a,n-a});
    }
    cout<<ans<<"\n";
}