// need
#include <iostream>
#include <algorithm>

// data structure
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include <complex>
//#include <deque>
#include <valarray>

// stream
//#include <istream>
//#include <sstream>
//#include <ostream>
#include <fstream>

// etc
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>

// input
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;

// output
#define OUT(d) std::cout<<(d);
#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<(d);
#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<(d);
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define SPBR(i, n) std::cout<<(i + 1 == n ? '\n' : ' ');
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define SHOW(d) {std::cerr << #d << "\t:" << (d) << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";}

// utility
#define ALL(a) (a).begin(),(a).end()
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)
#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)
#define REPLL(i, n) for(ll i=0;i<ll(n);++i)
#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
template<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }
template<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}
void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << "[Time:" << res << "ns  (" << res / (1.0e9) << "s)]\n"; }

// test
template<class T> std::vector<std::vector<T>> VV(int n, int m, T init = T()) {
	return std::vector<std::vector<T>>(n, std::vector<T>(m, init));
}
template<typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
	os << "(" << p.first << ", " << p.second << ")"; return os;
}

// type/const
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = 1 << 30;                          // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1;              // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60;                          // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);  // 9.22x10^18
constexpr double EPS = 1e-9;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;

template<class T, size_t N> void FILL(T(&a)[N], const T& val) { for (auto& x : a) x = val; }
template<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T& val) { for (auto& b : a) FILL(b, val); }
template<class T> void FILL(std::vector<T>& a, const T& val) { for (auto& x : a) x = val; }
template<class ARY, class T> void FILL(std::vector<std::vector<ARY>>& a, const T& val) { for (auto& b : a) FILL(b, val); }

// ------------>8------------------------------------->8------------

struct CSUM2D {
	int H, W;
	using TYPE = int;
	std::vector<std::vector<TYPE>> c;
	CSUM2D() : H(0), W(0) {}
	CSUM2D(int h, int w) : H(h), W(w), c(H + 1, std::vector<TYPE>(W + 1, 0)) {}
	CSUM2D(int h, int w, TYPE init) : H(h), W(w), c(H + 1, std::vector<TYPE>(W + 1, init)) {}

	// bit[y1][x1] += w;
	void add(int y1, int x1, TYPE w) {
		++y1; ++x1;
		c[y1][x1] += w;
	}
	void cumsum() {
		for (int i = 1; i <= H; ++i) c[i][0] += c[i - 1][0];
		for (int j = 1; j <= W; ++j) c[0][j] += c[0][j - 1];
		for (int i = 1; i <= H; ++i) for (int j = 1; j <= W; ++j) {
			c[i][j] += c[i - 1][j] + c[i][j - 1] - c[i - 1][j - 1];
		}
	}
	// return sum [y1, x1] x (y2, x2);
	TYPE sum(int y1, int x1, int y2, int x2) {
		return c[y2][x2] - c[y1][x2] - c[y2][x1] + c[y1][x1];
	}
	const std::vector<int>& operator[](const int& i) const {
		return c[i];
	}
};

signed main() {
	INIT;

	VAR(int, n, k);

	CSUM2D cw(k * 2, k * 2), cb(k * 2, k * 2);

	REP(_, n) {
		VAR(int, x, y);
		VAR(char, c);
		x %= k * 2;
		y %= k * 2;
		if (c == 'W') {
			cw.add(y, x, 1);
		}
		else {
			cb.add(y, x, 1);
		}
	}
	cw.cumsum();
	cb.cumsum();

	int ans = 0;
	auto calcw = [&](int i, int j) {
		int ti = i + k, tj = j + k;
		CHMAX(i, 0LL); CHMAX(j, 0LL); CHMAX(ti, 0LL); CHMAX(tj, 0LL);
		CHMIN(i, k * 2); CHMIN(j, k * 2); CHMIN(ti, k * 2); CHMIN(tj, k * 2);
		return cw.sum(i, j, ti, tj);
	};
	auto calcb = [&](int i, int j) {
		int ti = i + k, tj = j + k;
		CHMAX(i, 0LL); CHMAX(j, 0LL); CHMAX(ti, 0LL); CHMAX(tj, 0LL);
		CHMIN(i, k * 2); CHMIN(j, k * 2); CHMIN(ti, k * 2); CHMIN(tj, k * 2);
		return cb.sum(i, j, ti, tj);
	};
	FOR(i, -k * 2 + 1, 1) FOR(j, -k * 2 + 1, 1) {
		int sum = 0;
		REP(ii, 4) REP(jj, 2) {
			sum += calcw(i + k * ii, j + k * (jj * 2 + ii % 2));
			sum += calcb(i + k * ii, j + k * (jj * 2 + (ii + 1) % 2));
		}
		CHMAX(ans, sum);
	}
	OUT(ans)BR;
	return 0;
}

Measured memory_bytes: 62976