#include <bits/stdc++.h>
using namespace std;
#if __has_include(<boost/multiprecision/cpp_int.hpp>)
	#include <boost/multiprecision/cpp_int.hpp>
	#include <boost/multiprecision/cpp_dec_float.hpp>
	using bll = boost::multiprecision::cpp_int;
	using bdouble = boost::multiprecision::cpp_dec_float_100;
	using namespace boost::multiprecision;
#endif
#if __has_include(<boost/stacktrace.hpp>)
	#define BOOST_STACKTRACE_USE_ADDR2LINE
	#define BOOST_STACKTRACE_ADDR2LINE_LOCATION /usr/local/opt/binutils/bin/addr2line
	#define _GNU_SOURCE 1
	#include <boost/stacktrace.hpp>
#endif
#ifdef LOCAL_TEST
	namespace std {
		template<typename T> class dvector : public std::vector<T> {
		public:
			dvector() : std::vector<T>() {}
			explicit dvector(size_t n, const T& value = T()) : std::vector<T>(n, value) {}
			dvector(const std::vector<T>& v) : std::vector<T>(v) {}
			dvector(const std::initializer_list<T> il) : std::vector<T>(il) {}
			dvector(const std::string::iterator first, const std::string::iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::iterator first, const typename std::vector<T>::iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::reverse_iterator first, const typename std::vector<T>::reverse_iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::const_iterator first, const typename std::vector<T>::const_iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::const_reverse_iterator first, const typename std::vector<T>::const_reverse_iterator last) : std::vector<T>(first, last) {}
			T& operator[](size_t n) {
				try { return this->at(n); } catch (const std::exception& e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; return this->at(n); }
			}
			const T& operator[](size_t n) const {
				try { return this->at(n); } catch (const std::exception& e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; return this->at(n); }
			}
		};
	}
	class dbool {
	private:
		bool boolvalue;
	public:
		dbool() : boolvalue(false) {}
		dbool(bool b) : boolvalue(b) {}
		operator bool&() { return boolvalue; }
		operator const bool&() const { return boolvalue; }
	};
	#define vector dvector
	#define bool dbool
#endif
#ifdef LOCAL_DEV
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::vector<T>& v) {
		for (size_t i = 0; i < v.size(); ++i){ s << v[i]; if (i < v.size() - 1) s << "\t"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::vector<std::vector<T>>& vv) {
		s << "\\\n"; for (size_t i = 0; i < vv.size(); ++i){ s << vv[i] << "\n"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::deque<T>& v) {
		for (size_t i = 0; i < v.size(); ++i){ s << v[i]; if (i < v.size() - 1) s << "\t"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::set<T>& se) {
		s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::multiset<T>& se) {
		s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
	template <typename T, size_t N> std::ostream& operator<<(std::ostream& s, const std::array<T, N>& a) {
		s << "{ "; for (size_t i = 0; i < N; ++i){ s << a[i] << "\t"; } s << "}"; return s; }
	template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::map<T1, T2>& m) {
		s << "{\n"; for (auto itr = m.begin(); itr != m.end(); ++itr){ s << "\t" << (*itr).first << " : " << (*itr).second << "\n"; } s << "}"; return s; }
	template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::pair<T1, T2>& p) {
		return s << "(" << p.first << ", " << p.second << ")"; }
	class SIGFPE_exception : std::exception {};
	class SIGSEGV_exception : std::exception {};
	void catch_SIGFPE([[maybe_unused]] int e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; throw SIGFPE_exception(); }
	void catch_SIGSEGV([[maybe_unused]] int e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; throw SIGSEGV_exception(); }
	signed convertedmain();
	signed main() { signal(SIGFPE, catch_SIGFPE); signal(SIGSEGV, catch_SIGSEGV); return convertedmain(); }
	#define main() convertedmain()
	void debug_impl() { std::cerr << '\n'; }
	template<typename Head, typename... Tail> void debug_impl(Head head, Tail... tail) { std::cerr << " " << head << (sizeof...(tail) ? "," : ""); debug_impl(tail...); }
	#define debug(...) do { std::cerr << "(" << #__VA_ARGS__ << ") ="; debug_impl(__VA_ARGS__); } while (false)
#else
	#define debug(...) do {} while (false)
#endif
//#define int long long
using ll = long long;
//constexpr int INF = (ll)1e9 + 7;//INT_MAX=(1<<31)-1=2147483647
constexpr ll INF = (ll)1e18;//(1LL<<63)-1=9223372036854775807
constexpr ll MOD = (ll)1e9 + 7;
constexpr double EPS = 1e-9;
constexpr ll dx[4] = {1, 0, -1, 0};
constexpr ll dy[4] = {0, 1, 0, -1};
constexpr ll dx8[8] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr ll dy8[8] = {0, 1, 0, -1, 1, -1, 1, -1};
#define rep(i, n)   for(ll i=0, i##_length=(n); i< i##_length; ++i)
#define repeq(i, n) for(ll i=1, i##_length=(n); i<=i##_length; ++i)
#define rrep(i, n)   for(ll i=(n)-1; i>=0; --i)
#define rrepeq(i, n) for(ll i=(n)  ; i>=1; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
void p() { std::cout << '\n'; }
template<typename Head, typename... Tail> void p(Head head, Tail... tail) { std::cout << head << (sizeof...(tail) ? " " : ""); p(tail...); }
template<typename T> inline void pv(std::vector<T>& v) { for(ll i=0, N=v.size(); i<N; i++) std::cout << v[i] << " \n"[i==N-1]; }
template<typename T> inline bool chmax(T& a, T b) { return a < b && (a = b, true); }
template<typename T> inline bool chmin(T& a, T b) { return a > b && (a = b, true); }
template<typename T> inline void uniq(std::vector<T>& v) { v.erase(std::unique(v.begin(), v.end()), v.end()); }

/*-----8<-----template-----8<-----*/

template<typename T>
class Imos2D {
public:
	//vectorの要素数
	ll H, W;
	
	//vector<ll> Lx, Rx, Ly, Ry, V;
	//累積和したvector
	vector<vector<T>> rui;

	/*
	Imos2D(ll H, ll W, vector<ll> &Lx, vector<ll> &Rx, vector<ll> &Ly, vector<ll> &Ry, vector<ll> &V)
	 : H(H), W(W), Lx(Lx), Rx(Rx), Ly(Ly), Ry(Ry), V(V) {
		assert(Lx.size() == Rx.size());
		assert(Ly.size() == Ry.size());
		assert(Lx.size() == Ly.size());
		assert(Lx.size() == V.size());
		rui.assign(H, vector<ll>(W, 0));
		build();
	}

	Imos2D(ll H, ll W, vector<array<ll,5>> &range) : H(H), W(W) {
		rui.assign(H, vector<ll>(W, 0));
		ll rsize = range.size();
		Lx.assign(rsize, 0);
		Rx.assign(rsize, 0);
		Ly.assign(rsize, 0);
		Ry.assign(rsize, 0);
		V.assign(rsize, 0);
		for (ll i = 0; i < rsize; ++i) {
			Lx[i] = range[i][0];
			Rx[i] = range[i][1];
			Ly[i] = range[i][2];
			Ry[i] = range[i][3];
			V[i] = range[i][4];
		}
		build();
	}
	*/
	Imos2D(ll H, ll W) : H(H), W(W), rui(H, vector<T>(W, 0)) {}

	//[lx, rx) x [ly, ry)の範囲に val を加算する
	void add(ll lx, ll rx, ll ly, ll ry, T val) {
		if(lx==rx || ly==ry) return;
		//lx = clamp(lx, 0LL, H-1);
		//ly = clamp(ly, 0LL, W-1);
		rui[lx][ly] += val;
		if(rx < H) rui[rx][ly] -= val;
		if(ry < W) rui[lx][ry] -= val;
		if(rx < H && ry < W) rui[rx][ry] += val;
	}

	void build() {
		// 重みの加算
		/*
		for (ll i = 0, N = Lx.size(); i < N; ++i) {
			if(Lx[i]==Rx[i]||Ly[i]==Ry[i])continue;
			Lx[i] = clamp(Lx[i], 0LL, H-1);
			Ly[i] = clamp(Ly[i], 0LL, W-1);
			rui[Lx[i]][Ly[i]] += V[i];
			if(Rx[i] < H) rui[Rx[i]][Ly[i]] -= V[i];
			if(Ry[i] < W) rui[Lx[i]][Ry[i]] -= V[i];
			if(Rx[i] < H && Ry[i] < W) rui[Rx[i]][Ry[i]] += V[i];
		}
		*/
		// 横方向への累積和
		for (ll i = 0; i < H; ++i) 
			for (ll j = 1; j < W; ++j) 
				rui[i][j] += rui[i][j-1];
		// 縦方向の累積和
		for (ll i = 1; i < H; ++i) 
			for (ll j = 0; j < W; ++j) 
				rui[i][j] += rui[i-1][j];		
	}

	// ruiの[x1, x2) x [y1, y2)に対して関数fを適用した結果を返却する
	template<typename F>
	T query(ll x1, ll x2, ll y1, ll y2, F &f) {
		ll val = rui[x1][y1];
		for (ll i = 0; i < x2; ++i)
			for (ll j = 0; j < y2; ++j) 
				if(i>x1 || j>y1) val = f(val, rui[i][j]);
		return val;
	}

	// ruiの全域に対して関数fを適用した結果を返却する
	template<typename F>
	T query(F &f) {
		return query(0, H, 0, W, f);
	}
};

/*-----8<-----library-----8<-----*/

//https://atcoder.jp/contests/abc086/tasks/arc089_b
signed main() {
	ll N,K;
	cin>>N>>K;
	//vector<array<ll,5>> range;

	Imos2D<ll> imos(2*K+1, 2*K+1);
	rep(i,N){
		ll x, y;
		char s;
		cin>>x>>y>>s;
		x%=2*K, y%=2*K;
		if (((x < K && y < K) || (x >= K && y >= K)) == (s == 'B')) {
			x%=K, y%=K;
			imos.add(        0,     x + 1,         0,     y + 1, 1);
			imos.add(x + K + 1,     2 * K,         0,     y + 1, 1);
			imos.add(        0,     x + 1, y + K + 1,     2 * K, 1);
			imos.add(x + K + 1,     2 * K, y + K + 1,     2 * K, 1);
			imos.add(    x + 1, x + K + 1,     y + 1, y + K + 1, 1);
		} else {
			x%=K, y%=K;
			imos.add(    x + 1, x + K + 1,         0,     y + 1, 1);
			imos.add(    x + 1, x + K + 1, y + K + 1,     2 * K, 1);
			imos.add(        0,     x + 1,     y + 1, y + K + 1, 1);
			imos.add(x + K + 1,     2 * K,     y + 1, y + K + 1, 1);
		}
	}

	imos.build();
	//全域の最大値、全域の最小値、全域の総和
	auto maxlambda = [](ll x,ll y){ return max(x,y); };
	//auto minlambda = [](ll x,ll y){ return min(x,y); };
	//auto addlambda = [](ll x,ll y){ return x+y; };
	ll maxval = imos.query(maxlambda);
	cout<<maxval<<endl;

	return 0;
}



Measured memory_bytes: 31616