#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define sar(a,n) {cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl;}

using namespace std;

template<typename S,typename T>auto&operator<<(ostream&o,pair<S,T>p){return o<<"{"<<p.fi<<","<<p.se<<"}";}
template<typename T>auto&operator<<(ostream&o,set<T>s){for(auto&e:s)o<<e<<" ";return o;}
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,priority_queue<S,T,U>q){while(!q.empty())o<<q.top()<<" ",q.pop();return o;}
template<typename K,typename T>auto&operator<<(ostream&o,map<K,T>&m){for(auto&e:m)o<<e<<" ";return o;}
template<typename T>auto&operator<<(ostream&o,vector<T>v){for(auto&e:v)o<<e<<" ";return o;}
void ashow(){cout<<endl;}template<typename T,typename...A>void ashow(T t,A...a){cout<<t<<" ";ashow(a...);}
template<typename S,typename T,typename U>
struct TRI{S fi;T se;U th;TRI(){}TRI(S f,T s,U t):fi(f),se(s),th(t){}
bool operator<(const TRI&_)const{return(fi==_.fi)?((se==_.se)?(th<_.th):(se<_.se)):(fi<_.fi);}};
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,TRI<S,T,U>&t){return o<<"{"<<t.fi<<","<<t.se<<","<<t.th<<"}";}

typedef pair<int, int> P;
typedef pair<ll, ll> pll;
typedef TRI<int, int, int> tri;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<P> vp;
typedef vector<double> vd;
typedef vector<string> vs;

const int MAX_N = 1005;

int K;
int f[2 * MAX_N][2 * MAX_N];

void add(int lx, int ly, int rx, int ry){
    ++f[lx][ly], --f[rx][ly], --f[lx][ry], ++f[rx][ry];
}

void g(int x, int y){
    add(0, 0, x + 1, y + 1);
    add(0, y + K + 1, x + 1, 2 * K);
    add(x + K + 1, 0, 2 * K, y + 1);
    add(x + K + 1, y + K + 1, 2 * K, 2 * K);
    add(x + 1, y + 1, x + K + 1, y + K + 1);
}

void h(int x, int y){
    add(0, y + 1, x + 1, y + K + 1);
    add(x + 1, 0, x + K + 1, y + 1);
    add(x + 1, y + K + 1, x + K + 1, 2 * K);
    add(x + K + 1, y + 1, 2 * K, y + K + 1);
}

void func(int x, int y, int c)
{
    if(c == 0){
        if((x >= K && y < K) || (x < K && y >= K)){
            g(x % K, y % K);
        }else{
            h(x % K, y % K);
        }
    }else{
        if((x >= K && y < K) || (x < K && y >= K)){
            h(x % K, y % K);
        }else{
            g(x % K, y % K);
        }
    }
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n >> K;
    rep(i,n){
        int x, y;
        char c;
        cin >> x >> y >> c;
        func(x % (2 * K), y % (2 * K), (c == 'B'));
    }
    rep(i,2*K+1){
        rep(j,2*K){
            f[i][j+1] += f[i][j];
        }
    }
    rep(j,2*K+1){
        rep(i,2*K){
            f[i+1][j] += f[i][j];
        }
    }
    int ans = 0;
    rep(i,2*K){
        rep(j,2*K){
            cmx(ans, f[i][j]);
        }
    }
    cout << ans << "\n";
    return 0;
}

Measured memory_bytes: 16000