#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>

#define MOD 1000000007
#define MOD2 998244353
#define int long long
//#define PI 3.14159265358979

#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;

template < typename T >
ostream &operator<<(ostream &os, const vector< T > &A) {
	for (int i = 0; i < A.size(); i++)
		os << A[i] << " ";
	os << endl;
	return os;
}
template <>
ostream &operator<<(ostream &os, const vector< vector< int > > &A) {
	int N = A.size();
	int M;
	if (N > 0)
		M = A[0].size();
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < M; j++)
			os << A[i][j] << " ";
		os << endl;
	}
	return os;
}

typedef pair< int, int > pii;
typedef long long ll;

struct edge {
	int from, to, d, c;
	edge(int _from = 0, int _to = 0, int _d = 0, int _c = 0) {
		from = _from;
		to = _to;
		d = _d;
		c = _c;
	}
	bool operator<(const edge &rhs) const {
		return (d == rhs.d) ? (c < rhs.c) : (d < rhs.d);
	}
};

typedef vector< edge > edges;
typedef vector< edges > graph;
struct flow {
	int to, cap, rev, cost;
	flow(int to = 0, int cap = 0, int rev = 0, int cost = 0) : to(to), cap(cap), rev(rev), cost(cost) {}
};
typedef vector< vector< flow > > flows;

const int di[4] = {0, -1, 0, 1};
const int dj[4] = {-1, 0, 1, 0};
const int ci[5] = {0, 0, -1, 0, 1};
const int cj[5] = {0, -1, 0, 1, 0};
const ll LINF = LLONG_MAX / 2;
const int INF = INT_MAX / 2;
const double PI = acos(-1);

template < typename T, typename U >
bool chmin(T &x, const U &y) {
	if (x > y) {
		x = y;
		return true;
	}
	return false;
}
template < typename T, typename U >
bool chmax(T &x, const U &y) {
	if (x < y) {
		x = y;
		return true;
	}
	return false;
}

struct initializer {
	initializer() {
		cout << fixed << setprecision(11);
	}
};
initializer _____;
void imoadd(vector< vector< int > > &imo, int x1, int y1, int x2, int y2) {
	imo[y1][x1]++;
	if (x2)
		imo[y1][x2]--;
	if (y2)
		imo[y2][x1]--;
	if (y2 != 0 && x2 != 0)
		imo[y2][x2]++;
}
int N, M, K, T, Q;
signed main() {
	cin >> N >> K;
	int L = 2 * K;
	vector< pii > A(N);
	rep(i, N) {
		int x, y;
		char c;
		cin >> x >> y >> c;
		if (c == 'B')
			y += K;
		A[i] = pii(x % (2 * K), y % (2 * K));
	}
	vector< vector< int > > imo(2 * K, vector< int >(2 * K, 0));
	rep(i, N) {
		int x = A[i].first, y = A[i].second;
		rep(j, 2) {

			int x1 = (x - K + 1 + j * K + L) % L;
			int y1 = (y - K + 1 + j * K + L) % L;
			int x2 = (x - K + 1 + (1 - j) * K + L - 1) % L;
			int y2 = (y - K + 1 + (1 - j) * K + L - 1) % L;
			if (x1 > x2 && y1 > y2) {
				x2 = (x2 + 1) % L;
				y2 = (y2 + 1) % L;
				imoadd(imo, x1, y1, 0, 0);
				imoadd(imo, x1, 0, 0, y2);
				imoadd(imo, 0, y1, x2, 0);
				imoadd(imo, 0, 0, x2, y2);
			} else if (x1 > x2) {
				x2 = (x2 + 1) % L;
				y2 = (y2 + 1) % L;
				imoadd(imo, x1, y1, 0, y2);
				imoadd(imo, 0, y1, x2, y2);
			} else if (y1 > y2) {
				x2 = (x2 + 1) % L;
				y2 = (y2 + 1) % L;
				imoadd(imo, x1, y1, x2, 0);
				imoadd(imo, x1, 0, x2, y2);
			} else {
				x2 = (x2 + 1) % L;
				y2 = (y2 + 1) % L;
				imoadd(imo, x1, y1, x2, y2);
			}
			//cout << x1 << " " << y1 << " " << x2 << " " << y2 << endl;
		}
	}
	vector< vector< int > > tmp(2 * K, vector< int >(2 * K)), ans(2 * K, vector< int >(2 * K));
	int ans2 = 0;
	rep(i, 2 * K) rep(j, 2 * K) {
		if (j == 0) {
			tmp[i][j] = imo[i][j];
		} else {
			tmp[i][j] = imo[i][j] + tmp[i][j - 1];
		}
	}
	rep(j, 2 * K) rep(i, 2 * K) {
		if (i == 0) {
			ans[i][j] = tmp[i][j];
		} else {
			ans[i][j] = tmp[i][j] + ans[i - 1][j];
		}
	}
	rep(i, L) rep(j, L) {
		chmax(ans2, ans[i][j]);
	}
	//cout << imo << endl;
	//cout << tmp << endl;
	//cout << ans << endl;
	cout << ans2 << endl;
	return 0;
}

Measured memory_bytes: 95872