#define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <limits>
#include <numeric>
#include <valarray>
#include <fstream>

using namespace std;
typedef unsigned int uint;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<LL, LL> PP;
#define REP(i,a,n) for(LL i = (a); i < (LL)(n); ++i)
#define REM(i,a,n) for(LL i = ((n) - 1); i >= (a); --i)
#define FLOAT fixed << setprecision(16)
#define SPEEDUP {cin.tie(0); ios::sync_with_stdio(false);}
const int INF = 0x3FFFFFFF;
const LL INFLL = 0x3FFFFFFF3FFFFFFF;
const double INFD = 1.0e+308;
const string INFSTR = "\x7f";
const double EPS = 1.0e-9;

void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T, class U>
istream& operator>>(istream& ist, pair<T, U>& right) { return ist >> right.first >> right.second; }
template <class T, class U>
ostream& operator<<(ostream& ost, const pair<T, U>& right) { return ost << right.first << ' ' << right.second; }
template <class T, class TCompatible, size_t N>
void Fill(T(&dest)[N], const TCompatible& val) { fill(dest, dest + N, val); }
template <class T, class TCompatible, size_t M, size_t N>
void Fill(T(&dest)[M][N], const TCompatible& val) { for (int i = 0; i < M; ++i) Fill(dest[i], val); }
template<class T>
T Compare(T left, T right) { return left > right ? 1 : (left < right ? -1 : 0); }
istream& Ignore(istream& ist) { string s; ist >> s; return ist; }
bool Inside(int i, int j, int h, int w) { return i >= 0 && i < h && j >= 0 && j < w; }
// all_of
// partial_sum, adjacent_difference

#ifdef ONLY_MY_ENVIR
#include "IntMod.h"
#include "Union_Find.h"
#include "Graph.h"
#include "Range.h"
#include "Global.h"
#include "Flow_Solver.h"
#include "Tree.h"
#include "Suffix_Array.h"
#include "Geometry.h"
#include "Matrix.h"
#endif

#ifdef __GNUC__
typedef __int128 LLL;
istream& operator>> (istream& ist, __int128& val) { LL tmp;  ist >> tmp; val = tmp; return ist; }
ostream& operator<< (ostream& ost, __int128 val) { LL tmp = val; ost << tmp; return ost; }
#endif

#if 1234567891
#include <array>
#include <random>
#include <unordered_set>
#include <unordered_map>
template<typename T>
using PriorityQ = priority_queue<T, vector<T>, greater<T> >;	// コスト小を優先
#endif


int F[3000][3000];

int main() {
	int N, K;
	cin >> N >> K;

	REP(i, 0, N) {
		int x, y;
		char c;
		bool isb;
		cin >> x >> y >> c;
		if (c == 'W') y += K;
		x %= 2 * K;
		if (x >= K) {
			x -= K;
			y += K;
		}
		y %= 2 * K;
		F[x][y]++;
		F[x + K][(y + K) % (2 * K)]++;
	}

	REP(i, 2 * K, 3 * K) {
		REP(j, 0, 2 * K) {
			F[i][j] = F[i - 2 * K][j];
		}
	}

	REP(i, 0, 3 * K) {
		REP(j, 2 * K, 3 * K) {
			F[i][j] = F[i][j - 2 * K];
		}
	}

	REP(i, 0, K * 3) {
		int sum = 0;
		REP(j, 0, K * 3) {
			sum += F[i][j];
			F[i][j] = sum;
		}
	}

	REP(j, 0, K * 3) {
		int sum = 0;
		REP(i, 0, K * 3) {
			sum += F[i][j];
			F[i][j] = sum;
		}
	}

	int ans = -INF;
	REP(i, 0, K * 2) {
		REP(j, 0, K * 2) {
			int sum = 0;
			sum += F[i + K][j + K] - F[i + K][j] - F[i][j + K] + F[i][j];
			ans = max(ans, sum);
		}
	}
	cout << ans << endl;

	return 0;
}

Measured memory_bytes: 35456