#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define int long long
int n,k,x[100007],y[100007],id[100007],fl[2007][2007],sum[2007][2007],ans=0;
char c[100007];
bool cmp(int a,int b){
	return (x[a]<x[b] || (x[a]==x[b] && y[a]<y[b]) || (x[a]==x[b] && y[a]==y[b] && a<b));
}
int get(int lx,int ly,int rx,int ry){
	if(lx>rx || ly>ry) return 0;
	return sum[rx][ry]-sum[rx][ly-1]-sum[lx-1][ry]+sum[lx-1][ly-1];
}
signed main(){
	ios_base::sync_with_stdio(0);
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		cin>>x[i]>>y[i]>>c[i];
		if(c[i]=='B') x[i]-=k;
		id[i]=i;
	}
	sort(id+1,id+1+n,cmp);
	int sx=x[id[1]],sy=y[id[1]];
	fl[1][1]++;
	for(int j=2;j<=n;j++){
		int i=id[j];
		int cx=(x[i]-sx)%(2*k);
		int cy=(y[i]-sy+(2*k*1e9))%(2*k);
		if(cx<0) cx+=2*k;
		if(cy<0) cy+=2*k;
		cx++;
		cy++;
		fl[cx][cy]++;
		//cout<<((x[i]-sx)%(2*k))+1<<" "<<((y[i]-sy)%(2*k))+1<<endl;
	}
	ans=0;
	memset(sum,0,sizeof(sum));
	sum[1][1]=fl[1][1];
	for(int i=2;i<=2*k;i++){
		sum[i][1]=sum[i-1][1]+fl[i][1];
		sum[1][i]=sum[1][i-1]+fl[1][i];
	}
	for(int i=2;i<=2*k;i++){
		for(int j=2;j<=2*k;j++){
			sum[i][j]=sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1]+fl[i][j];
		}
	}
	for(int i=1;i<=k;i++){
		for(int j=1;j<=k;j++){
			int val=get(1,1,i,j)+get(i+k+1,1,2*k,j)+get(1,j+k+1,i,2*k)+get(i+1,j+1,i+k,j+k);
			ans=max(ans,max(val,n-val));
			//cout<<val<<" ";
		}
		//cout<<endl;
	}
	cout<<ans;
}
