//Zory-2020
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
// typedef __int128 ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define FR first
#define SE second
#define MP make_pair
#define PB push_back
#define vc vector
#define db double
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define bin(x) (1ll<<(x))
#define fo(i,l,r) for(int i=(l),I=(r);i<=I;i++)
#define fd(i,r,l) for(int i=(r),I=(l);i>=I;i--)
#define mem(x,val) memset(x,val,sizeof x)
#define Swap(a,b,n) for(int I=0;I<=n;I++) swap(a[I],b[I])
#define PC __builtin_popcountll
#ifdef DEBUG
	#define debug(A,args...) fprintf(stderr,A,##args)
#else
	#define debug(A,args...) printf("")
#endif
namespace mine
{
	ll qread()
	{
		ll ans=0,f=1;char c=getchar();
		while(c<'0' or c>'9') {if(c=='-')f=-1;c=getchar();}
		while('0'<=c and c<='9') ans=ans*10+c-'0',c=getchar();
		return ans*f;
	}
	void write(ll num){if(num<0) putchar('-'),num=-num;if(num>=10) write(num/10);putchar('0'+num%10);}
	void write1(ll num){write(num);putchar(' ');}
	void write2(ll num){write(num);putchar('\n');}
	template<typename T>inline bool chmax(T&a,const T&b){return a<b?a=b,1:0;}
	template<typename T>inline bool chmin(T&a,const T&b){return a>b?a=b,1:0;}
	ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}
	bool IN(ll x,ll l,ll r){return l<=x and x<=r;}
	void GG(){puts("No");exit(0);}
	
	const db eps=1e-8;
	const int INF=0x3f3f3f3f;
	const int MOD=1e9+7;
	int mm(const int x){return x>=MOD?x-MOD:x;}
	template<typename T> void add(T &x,const int &y){x=(x+y>=MOD?x+y-MOD:x+y);}
	ll qpower(ll x,ll e,int mod=MOD){ll ans=1;while(e){if(e&1)ans=ans*x%mod;x=x*x%mod;e>>=1;}return ans;}
	ll invm(ll x){return qpower(x,MOD-2);}
	const int M=5e6+10;
	ll fac[M],facinv[M],Inv[M];ll C(int n,int m){return n<0 or n<m?0:fac[n]*facinv[m]%MOD*facinv[n-m]%MOD;}
	void PRE()
	{
		fac[0]=1;fo(i,1,M-1) fac[i]=fac[i-1]*i%MOD;
		facinv[M-1]=invm(fac[M-1]);fd(i,M-1,1) facinv[i-1]=facinv[i]*i%MOD;
		Inv[1]=1;fo(i,2,M-1) Inv[i]=(MOD-MOD/i)*Inv[MOD%i]%MOD;
	}
	const int N=2e3+10;
	//------------------FIXED------------------
	int S[2][N][N];
	void ins(int op,int x,int y){ S[op][x][y]++; }
	int ask(int op,int xl,int xr,int yl,int yr){ 
		chmax(xl,0),chmax(yl,0),chmin(xr,N-1),chmin(yr,N-1);
		if(xl>xr or yl>yr) return 0;
		return S[op][xr][yr]-(xl?S[op][xl-1][yr]:0)-(yl?S[op][xr][yl-1]:0)+(xl and yl?S[op][xl-1][yl-1]:0); }
	void main()
	{
		int n=qread(),K=qread();while(n--){ int x=qread(),y=qread();char c[10];scanf("%s",c);ins(c[0]=='B',x%(K+K),y%(K+K)); }
		fo(op,0,1) fo(i,0,N-1) fo(j,0,N-1) S[op][i][j]+=(i?S[op][i-1][j]:0)+(j?S[op][i][j-1]:0)-(i and j?S[op][i-1][j-1]:0);int ans=0;
		fo(xl,0,K) fo(yl,0,K) fo(c,0,1)
		{
			int xr=xl+K-1,yr=yl+K-1;
			chmax(ans,  ask(c,xl,xr,yl,yr)+
						ask(c^1,xl-K,xl-1,yl,yr)+ask(c^1,xr+1,xr+K,yl,yr)+ask(c^1,xl,xr,yl-K,yl-1)+ask(c^1,xl,xr,yr+1,yr+K)+
						ask(c,xl-K,xl-1,yl-K,yl-1)+ask(c,xr+1,xr+K,yl-K,yl-1)+ask(c,xl-K,xl-1,yr+1,yr+K)+ask(c,xr+1,xr+K,yr+1,yr+K) );
		}write(ans);
	}
};//����������
signed main()
{
	#ifdef DEBUG
	//freopen("a.in","r",stdin);
	freopen("z.txt","r",stdin);
	//freopen("a.out","w",stdout);
	#endif
	srand(time(0));
	mine::PRE();//����Ԥ����ģ����
	mine::main();
	debug("\n---------------------Zory---------------------\nTime: %.2lf s",1.0*clock()/CLOCKS_PER_SEC);
}

Measured memory_bytes: 148992