#include <iostream>
#include <queue>
#include <map>
#include <list>
#include <vector>
#include <string>
#include <stack>
#include <limits>
#include <climits>
#include <cassert>
#include <fstream>
#include <cstring>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <cstdio>
#include <ciso646>
#include <set>
#include <array>
#include <unordered_map>
#include <unordered_set>
#include <type_traits>

using namespace std;

#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<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)

#define inf 0x3f3f3f3f
#define PB push_back
#define MP make_pair
#define ALL(a) (a).begin(),(a).end()
#define SET(a,c) memset(a,c,sizeof a)
#define CLR(a) memset(a,0,sizeof a)
#define VS vector<string>
#define VI vector<ll>
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define MIN(a,b) (a>b?b:a)
#define MAX(a,b) (a>b?a:b)
#define pi 2*acos(0.0)
#define INFILE() freopen("in0.txt","r",stdin)
#define OUTFILE()freopen("out0.txt","w",stdout)
#define ll long long
#define ull unsigned long long
#define pii pair<ll,ll>
#define pcc pair<char,char>
#define pic pair<ll,char>
#define pci pair<char,ll>
#define eps 1e-14
#define FST first
#define SEC second
#define SETUP cin.tie(0), ios::sync_with_stdio(false), cout << setprecision(15)

namespace {
	struct input_returnner {
		ll N; input_returnner(ll N_ = 0) :N(N_) {}
		template<typename T> operator vector<T>() const { vector<T> res(N); for (auto &a : res) cin >> a; return std::move(res); }
		template<typename T> operator T() const { T res; cin >> res; return res; }
		template<typename T> T operator - (T right) { return T(input_returnner()) - right; }
		template<typename T> T operator + (T right) { return T(input_returnner()) + right; }
		template<typename T> T operator * (T right) { return T(input_returnner()) * right; }
		template<typename T> T operator / (T right) { return T(input_returnner()) / right; }
		template<typename T> T operator << (T right) { return T(input_returnner()) << right; }
		template<typename T> T operator >> (T right) { return T(input_returnner()) >> right; }
	};
	template<typename T> input_returnner in() { return in<T>(); }
	input_returnner in() { return input_returnner(); }
	input_returnner in(ll N) { return std::move(input_returnner(N)); }
}

ll MOD = 1e9 + 7;

void solve();

signed main() {
	SETUP;
	solve();
#ifdef _DEBUG
	system("pause");
#endif
	return 0;
}

#define int ll

template < typename T >
struct is_vector : std::false_type {};

template < typename T >
struct is_vector<std::vector<T>> : std::true_type {};

template < typename T >
constexpr bool is_vector_v = is_vector<T>::value;

template <typename T>
std::ostream& operator<< (std::ostream& out, const std::vector<T>& v) {
	if (!v.empty()) {
		for (int i = 0; i < v.size(); ++i) {
			out << v[i] << (i == v.size() - 1 ? "\n" : (is_vector_v<T> ? "" : ", "));
		}
	}
	return out;
}

void solve() {
	int N, K; cin >> N >> K;
	int w = 2 * K;
	vector<vector<int> > k(3 * K+1, vector<int>(3 * K+1));
	vector <pii> p;
	REP(i, N) {
		string c;
		int x, y; cin >> x >> y >> c;
		if (c == "B") {
			x += K;
		}
		x %= w;
		y %= w;
		int minx = x - (K - 1);
		int maxx = x + 1;
		int miny = y - (K - 1);
		int maxy = y + 1;
		k[minx+K][miny+K] += 1;
		k[minx+K][maxy+K] -= 1;
		k[maxx+K][miny+K] -= 1;
		k[maxx+K][maxy+K] += 1;
	}
	FOR(i, 1, k.size()) {
		FOR(j, 1, k[i].size()) {
			k[i][j] = k[i][j - 1] + k[i][j];
		}
	}
	FOR(i, 1, k.size()) {
		FOR(j, 1, k[i].size()) {
			k[i][j] = k[i-1][j] + k[i][j];
		}
	}

	FOR(i, 0, k.size()) {
		FOR (j, 0, k[i].size()) {
			int x = j - K;
			int y = i - K;
			if (x < 0 or y < 0) {
				x = (x + w) % w;
				y = (y + w) % w;
				k[y+K][x+K] += k[i][j];
			}
		}
	}


	vector<vector<int> > field(2*K, vector<int>(2*K));
	int ma = 0;
	FOR(i, K, 3 * K) {
		FOR(j, K, 3 * K) {
			field[i-K][j-K] = k[i][j];
		}
	}

	REP(i, 2*K) {
		REP(j, K) {
			field[i][j] += field[(i+K)%(2*K)][(j+K)%(2*K)];
			ma = max(ma, field[i][j]);
		}
	}
	
	cout << ma << endl;
}


Measured memory_bytes: 102016