#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
#define int long long
#define pb push_back
#define fi first
#define se second
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define all(x) x.begin(), x.end()
#define IO ios :: sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define pii pair<int,int>
#define sz(x) (int)x.size()
const int mod = 1e9 + 7;
const int mod1 = 998244353;
typedef long double f80;

#ifndef LOCAL
#pragma GCC optimize ("O2")
#define endl '\n'
#endif

template<typename T>
using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r){
    uniform_int_distribution<int> uid(l, r);
    return uid(rng);
}

ll pwr(ll a,ll b, ll mod){
    a %= mod;
    int ans = 1;
    while(b){
        if(b & 1) ans = (ans * a) % mod;
        a = (a * a) % mod;
        b >>= 1;
    }
    return ans;
}

string to_string(string s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

const int N = 1e5 + 5;
const int K = 2005;
int x[N], y[N];
int a[K][K], b[K][K];
int sum(int x1,int y1,int x2,int y2,int a[][K]){
	int ans = 0;
	x1--, y1--;
	ans += a[x2][y2];
	ans -= a[x1][y2];
	ans -= a[x2][y1];
	ans += a[x1][y1];
	return ans;
}
void solve(){
	int n, k;
	cin >> n >> k;
	fr(i, 1, n){
		cin >> x[i] >> y[i];
		char ch;
		cin >> ch;
		x[i] %= (2 * k), y[i] %= (2 * k);
		if(x[i] == 0) x[i] = 2 * k;
		if(y[i] == 0) y[i] = 2 * k;
		if(ch == 'B')
			a[x[i]][y[i]]++;
		else
			b[x[i]][y[i]]++;
	}
	fr(i, 1, 2 * k){
		fr(j, 1, 2 * k){
			a[i][j] += a[i - 1][j] + a[i][j - 1] - a[i - 1][j - 1];
			b[i][j] += b[i - 1][j] + b[i][j - 1] - b[i - 1][j - 1];
		}
	}
	int ans = 0;
	fr(i, 1, k){
		fr(j, 1, k){
			int val = 0;
			val += sum(1, 1, i, j, a);
			val += sum(1, j + 1, i, j + k, b);
			val += sum(1, j + k + 1, i, 2 * k, a);
			val += sum(i + 1, 1, k + i, j, b);
			val += sum(i + 1, j + 1, k + i, j + k, a);
			val += sum(i + 1, j + k + 1, k + i, 2 * k, b);
			val += sum(i + k + 1, 1, 2 * k, j, a);
			val += sum(i + k + 1, j + 1, 2 * k, j + k, b);
			val += sum(i + k + 1, j + k + 1, 2 * k, 2 * k, a);
			ans = max(ans, val);
			ans = max(ans, n - val);
		}
	}
	cout << ans;
}
signed main(){
    IO;
    #ifdef LOCAL
        freopen("inp.txt","r", stdin);
        freopen("out.txt", "w", stdout);
    #endif
    cout << setprecision(10) << fixed;
    int t = 1;
    // cin >> t;
    fr(tt, 1, t){
        solve();
    }
    return 0;
}

Measured memory_bytes: 64640