#include <bits/stdc++.h>

#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());

typedef long long LL;
template<typename T> using V = std::vector<T>;
template<typename T> using VV = std::vector<std::vector<T>>;
template<typename T> using VVV = std::vector<std::vector<std::vector<T>>>;

template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
template<class T> inline void print(T x) { std::cout << x << std::endl; }
template<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) {  if (i != 0) {std::cout << " ";} std::cout << v[i];} std::cout << "\n"; }
template<class T> inline bool inside(T y, T x, T H, T W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }

const int INF = 1L << 30;
const double EPS = 1e-9;
const std::string YES = "YES", Yes = "Yes", NO = "NO", No = "No";
const std::vector<int> dy4 = { 0, 1, 0, -1 }, dx4 = { 1, 0, -1, 0 };    // 4近傍（右, 下, 左, 上）
const std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };

using namespace std;

class CumulativeSum {

public:
    std::vector<long long> memo1;               // 1次元用の累積和表
    std::vector<std::vector<long long>> memo2;  // 2次元用の累積和表

    CumulativeSum() {}

    void build(const std::vector<long long> &line) {
        this->memo1.assign(line.size() + 1, 0);

        for (long long i = 0; i < line.size(); ++i) {
            this->memo1[i + 1] = this->memo1[i] + line[i];
        }
    }

    // 2次元の累積和表を作成
    void build(const std::vector<std::vector<long long>> &board) {
        int height = board.size();
        int width = board[0].size();
        this->memo2.assign(height + 1, std::vector<long long>(width + 1, 0));

        for (int y = 0; y < height; ++y) {
            for (int x = 0; x < width; ++x) {
                memo2[y + 1][x + 1] = board[y][x] + memo2[y + 1][x];
            }
            for (int x = 0; x < width; ++x) {
                memo2[y + 1][x + 1] += memo2[y][x + 1];
            }
        }
    }

    long long sum(int left, int right) {
        return this->memo1[right] - this->memo1[left];
    }

    /*
    (y1, x1)から(y2, x2)の合計を返す．(y2, x2)は含まない
    座標はmemoを作成したboard準拠
    (ex, sum(0, 0, 2, 2)なら(0, 0), (0, 1), (1, 0), (1, 1)の合計を返す)
    */
    long long sum(int y1, int x1, int y2, int x2) {
        return this->memo2[y2][x2] - this->memo2[y2][x1] - this->memo2[y1][x2] + this->memo2[y1][x1];
    }
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N, K;
    cin >> N >> K;

    vector<vector<LL>> white(2 * K, vector<LL>(2 * K, 0));
    vector<vector<LL>> black(2 * K, vector<LL>(2 * K, 0));

    int total_b = 0;
    int total_w = 0;
    FOR(_, 0, N) {
        int x, y;
        char c;
        cin >> x >> y >> c;
        if (c == 'W') {
            white.at(y % (2 * K)).at(x % (2 * K))++;
            total_w++;
        }
        else {
            black.at(y % (2 * K)).at(x % (2 * K))++;
            total_b++;
        }
    }

    CumulativeSum cs_w, cs_b;
    cs_w.build(white);
    cs_b.build(black);

    LL ans = 0;
    FOR(y, 0, K) {
        FOR(x, 0, K) {
            LL b = 0;
            b += cs_b.sum(0, 0, y, x);
            b += cs_b.sum(y, x, y + K, x + K);
            b += cs_b.sum(y + K, x + K, 2 * K, 2 * K);
            b += cs_b.sum(0, x + K, y, 2 * K);
            b += cs_b.sum(y + K, 0, 2 * K, x);

            LL w = 0;
            w += cs_w.sum(0, 0, y, x);
            w += cs_w.sum(y, x, y + K, x + K);
            w += cs_w.sum(y + K, x + K, 2 * K, 2 * K);
            w += cs_w.sum(0, x + K, y, 2 * K);
            w += cs_w.sum(y + K, 0, 2 * K, x);

            ans = max(ans, b + (total_w - w));
        }
    }
    FOR(y, 0, K) {
        FOR(x, 0, K) {
            LL w = 0;
            w += cs_w.sum(0, 0, y, x);
            w += cs_w.sum(y, x, y + K, x + K);
            w += cs_w.sum(y + K, x + K, 2 * K, 2 * K);
            w += cs_w.sum(0, x + K, y, 2 * K);
            w += cs_w.sum(y + K, 0, 2 * K, x);

            LL b = 0;
            b += cs_b.sum(0, 0, y, x);
            b += cs_b.sum(y, x, y + K, x + K);
            b += cs_b.sum(y + K, x + K, 2 * K, 2 * K);
            b += cs_b.sum(0, x + K, y, 2 * K);
            b += cs_b.sum(y + K, 0, 2 * K, x);

            ans = max(ans, (total_b - b) + w);
        }
    }
    print(ans);

    return 0;
}

Measured memory_bytes: 125568