#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>

#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif

// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif

using namespace std;
typedef long long ll;
//typedef pair<int,int> Pint;
typedef pair<ll, ll> P;
//typedef pair<int, pair<int, int>> P;
//typedef tuple<int,int,int> T;
typedef vector<ll> vec;
typedef vector<vec> mat;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define revrep(i, n) for(ll i = n-1; i >= 0; i--)
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}

ll INFL = 1000000000000000010;//10^18 = 2^60
int INF = 1000000000;//10^9
ll MOD  = 1000000007;
//vector<int> dy = {0,0,1,-1};
//vector<int> dx = {1,-1,0,0};

ll dp[2010][1010];
ll sum[2010][1010];

int main(void){
  ll N, K; cin >> N >> K;
  vector<pair<ll, ll>> xy(N);
  rep(i, N){
    ll x, y;
    char c;
    cin >> x >> y >> c;
    if(c == 'W') x += K;
    x %= 2 * K;
    y %= 2 * K;
    if(y >= K){
      if(x >= K){
        x -= K;
        y -= K;
      }else{
        x += K;
        y -= K;
      }
    }
    xy[i] = {x, y};
  }

  rep(i, N){
    dp[xy[i].first][xy[i].second]++;
  }
  rep(i, 2 * K)rep(j, K){
    sum[i+1][j+1] = sum[i+1][j] + sum[i][j+1] - sum[i][j] + dp[i][j];
  }

  ll ans = 0;
  for(int y = 1; y <= K; y++){
    for(int x = 1; x <= 2 * K; x++){
      ll ret = 0;
      if(y == 1){
        if(x <= K + 1){
          ret += sum[x + K - 1][1 + K - 1];
          ret -= sum[x - 1][1 + K - 1];
        }else{
          ret += sum[2 * K][1 + K - 1];
          ret -= sum[x - 1][1 + K - 1];
          ret += sum[x - K - 1][1 + K - 1];
        }
      }else{
        if(x <= K + 1){
          ret += sum[x + K - 1][K] - sum[x + K - 1][y - 1] - sum[x - 1][K] + sum[x - 1][y - 1];
          ret += sum[x - 1][y - 1];
          ret += sum[2 * K][y - 1] - sum[x + K - 1][y - 1];
        }else{
          ret += sum[2 * K][K] - sum[2 * K][y-1] - sum[x - 1][K] + sum[x - 1][y - 1];
          ret += sum[x - 1][y - 1] - sum[x - 1 - K][y - 1];
          ret += sum[x - K - 1][K] - sum[x - K - 1][y - 1];
        }
      }
      ans = max(ans, ret);
    }
  }
  cout << ans << endl;


}


Measured memory_bytes: 33408