#include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
#include <tuple>
#include <time.h>

using namespace std;

typedef long long ll;
typedef pair<ll,ll> P;

long long int INF = 3e18;
double Pi = 3.1415926535897932384626;

vector<ll> G[500005];
vector<P> tree[500010];
priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop

int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//ll bit[500005];
//↓,→,↑,←


#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<(x)<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pd(x) cerr<<"//"<<(x)<<endl;
#define re(i,n) for(i=0;i<n;i++);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define deba(x) cout<< #x << " = " << x <<endl


ll mod = 1000000007;
ll rui(ll number1,ll number2){
    if(number2 == 0){
        return 1;
    }else{
        ll number3 = rui(number1,number2 / 2);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll gcd(ll number1,ll number2){
    if(number1 > number2){
        swap(number1,number2);
    }
    if(number1 == 0 || number1 == number2){
        return number2;
    }else{
        return gcd(number2 % number1,number1);
    }
}
void YES(bool condition){
    if(condition){
        p("YES");
    }else{
        p("NO");
    }
    return;
}
void Yes(bool condition){
    if(condition){
        p("Yes");
    }else{
        p("No");
    }
    return;
}

ll n,m,num,sum,ans,a,b,c,d,e,g,h,i,j,k,ok,ng,l,q;
ll x[500005],y[500005],z[500005],w[500005];
ll banb[5005][5005],banw[5005][5005];
char s[500005],t[500005];
bool flag,dame;

ll cnt(ll si,ll ei,ll sj,ll ej,bool color){
	a = 0;
	if(color){
		a = banw[ei][ej] - banw[ei][sj-1] - banw[si-1][ej] + banw[si-1][sj-1];
	}else{
		a = banb[ei][ej] - banb[ei][sj-1] - banb[si-1][ej] + banb[si-1][sj-1];
	}
	return a;
}


int main(){
    cin >> n >> k;
	for(i=0;i<n;i++){
		cin >> x[i] >> y[i];
		x[i] %= 2 * k;
		y[i] %= 2 * k;
		num = 0;
		if(x[i] >= k){
			x[i] -= k;
			num ++;
		}
		if(y[i] >= k){
			y[i] -= k;
			num ++;
		}
		cin >> s;
		if((num % 2 == 0 && s[0] == 'W') || num % 2 == 1 && s[0] == 'B'){
			banw[x[i]+1][y[i]+1]++;
		}else{
			banb[x[i]+1][y[i]+1]++;
		}
	}
	for(i=1;i<=k;i++){
		for(j=1;j<=k;j++){
			banw[i][j] += banw[i-1][j];
			banb[i][j] += banb[i-1][j];
		}
	}
	for(i=1;i<=k;i++){
		for(j=1;j<=k;j++){
			banw[i][j] += banw[i][j-1];
			banb[i][j] += banb[i][j-1];
		}
	}
	ans = 0;
	for(i=1;i<=k;i++){
		for(j=1;j<=k;j++){
			b = cnt(1,i,1,j,0) + cnt(i+1,k,j+1,k,0) + cnt(i+1,k,1,j,1) + cnt(1,i,j+1,k,1);
			c = cnt(1,i,1,j,1) + cnt(i+1,k,j+1,k,1) + cnt(i+1,k,1,j,0) + cnt(1,i,j+1,k,0);
			num = max(b,c);
			ans = max(ans,num);
		}
	}
	assert(ans <= n);
	p(ans);

	return 0;
}

Measured memory_bytes: 108416