#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"

using namespace std;
typedef long long int ll;

#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(auto cnt=0ll;(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
template<typename T1, typename T2> ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }
template<typename T> T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> T& minset(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }
mt19937_64 randdev(8901016);
inline ll rand_range(ll l, ll h) {
    return uniform_int_distribution<ll>(l, h)(randdev);
}

#if defined(_WIN32) || defined(_WIN64)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#elif defined(__GNUC__)
#else
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T> void input_integer(T& var) {
            var = 0; T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc && cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var * sign;
        }
        inline int c() { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) { input_integer<int>(var); return *this; }
        inline MaiScanner& operator>>(long long& var) { input_integer<long long>(var); return *this; }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiblechar(cc); cc = getchar_unlocked());
            for (; isvisiblechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
            return *this;
        }
        template<typename IT> void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
    };
    class MaiPrinter {
    public:
        template<typename T>
        void output_integer(T var) {
            if (var == 0) { putchar_unlocked('0'); return; }
            if (var < 0)
                putchar_unlocked('-'),
                var = -var;
            char stack[32]; int stack_p = 0;
            while (var)
                stack[stack_p++] = '0' + (var % 10),
                var /= 10;
            while (stack_p)
                putchar_unlocked(stack[--stack_p]);
        }
        inline MaiPrinter& operator<<(char c) { putchar_unlocked(c); return *this; }
        inline MaiPrinter& operator<<(int var) { output_integer<int>(var); return *this; }
        inline MaiPrinter& operator<<(long long var) { output_integer<long long>(var); return *this; }
        inline MaiPrinter& operator<<(char* str_p) { while (*str_p) putchar_unlocked(*(str_p++)); return *this; }
        inline MaiPrinter& operator<<(const string& str) {
            const char* p = str.c_str();
            const char* l = p + str.size();
            while (p < l) putchar_unlocked(*p++);
            return *this;
        }
        template<typename IT> void join(IT begin, IT end, char sep = '\n') { for (auto it = begin; it != end; ++it) *this << *it << sep; }
    };
}
MaiScanner scanner;
MaiPrinter printer;




ll m, n, kei;

ll mtx[2010][2010][2];

ll sum_W[2010][2010];
ll sum_B[2010][2010];

template<typename T>
inline ll get(T ptr, int by, int bx, int ay, int ax) {
    return ptr[ay][ax] - ptr[ay][bx] - ptr[by][ax] + ptr[by][bx];
}

int main() {
    scanner >> n >> kei;

    repeat(i, n) {
        string str;
        ll x, y;
        scanner >> x >> y >> str;
        char c = str[0];

        x %= kei*2;
        y %= kei*2;
        ++x,++y;
        mtx[y][x][c == 'B']++;
        // mtx[y][x + kei][c == 'B']++;
        // mtx[y + kei][x][c == 'B']++;
        // mtx[y + kei][x + kei][c == 'B']++;
    }

    iterate(y, 1, 2010) {
        iterate(x, 1, 2010) {
            sum_W[y][x] += mtx[y][x][0] + sum_W[y - 1][x] + sum_W[y][x - 1] - sum_W[y - 1][x - 1];
            sum_B[y][x] += mtx[y][x][1] + sum_B[y - 1][x] + sum_B[y][x - 1] - sum_B[y - 1][x - 1];
        }
    }

    //debugaa(sum_W, 10, 10)
    //debugaa(sum_B, 10, 10)

    ll best = 0;

    iterate(y, 0, kei) {
        iterate(x, 0, kei) {
            ll w = 0, b = 0;
            w += get(sum_W, y, x, 0, 0);
            w += get(sum_W, y, kei * 2, 0, x + kei);
            w += get(sum_W, kei * 2, x, y + kei, 0);
            w += get(sum_W, kei * 2, kei * 2, y + kei, x + kei);
            w += get(sum_W, y + kei, x + kei, y, x);
            b += get(sum_B, y, x + kei, 0, x);
            b += get(sum_B, y + kei, x, y, 0);
            b += get(sum_B, kei * 2, x + kei, y + kei, x);
            b += get(sum_B, y + kei, kei * 2, y, x + kei);
            maxset(best, w + b);
            //cout << make_pair(x, y) << make_pair(w, b) << endl;
        }
    }

    iterate(y, 0, kei) {
        iterate(x, 0, kei) {
            ll w = 0, b = 0;
            b += get(sum_B, y, x, 0, 0);
            b += get(sum_B, y, kei * 2, 0, x + kei);
            b += get(sum_B, kei * 2, x, y + kei, 0);
            b += get(sum_B, kei * 2, kei * 2, y + kei, x + kei);
            b += get(sum_B, y + kei, x + kei, y, x);
            w += get(sum_W, y, x + kei, 0, x);
            w += get(sum_W, y + kei, x, y, 0);
            w += get(sum_W, kei * 2, x + kei, y + kei, x);
            w += get(sum_W, y + kei, kei * 2, y, x + kei);
            maxset(best, w + b);
            //cout << make_pair(x, y) << make_pair(w, b) << endl;
        }
    }

    cout << best << endl;

    return 0;
}

Measured memory_bytes: 126208