#ifndef DEBUG
#  define NDEBUG
#endif
#include <iostream>
#include <algorithm>
#include <string>
#include <iterator>
#include <utility>
#include <type_traits>
#include <limits>
#include <cassert>
#include <numeric>
#include <vector>

using namespace std;

// template {{{
// misc {{{
using Z = long long;
[[maybe_unused]]
constexpr Z INF = numeric_limits<Z>::max() / 3;
// }}}

// debug {{{
template <class T>
using enable_if_sequence_t = enable_if_t<
  is_same<
    typename iterator_traits<
      typename remove_cv_t<remove_reference_t<T>>::iterator
    >::iterator_category,
    random_access_iterator_tag>{}>;
#ifdef NDEBUG
# define dump(x)
# define debug if (0)
template <class T>
inline T&& ix(T&& value) { return value; }
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix(T&& container, Index index, Indices... indices) {
  return ix(container[index], indices...);
}
#else
# define dump(x) do { \
    cerr << "\e[33m[dump: " << __LINE__ << "] " << (#x) << " = " << x << "\e[0m" << endl; \
  } while (0);
# define debug
template <class T>
inline auto&& ix_impl([[maybe_unused]] int line, [[maybe_unused]] const char* code, T&& value) {
  return value;
}
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix_impl(int line, const char* code, T&& container, Index index, Indices... indices) {
  if (index < 0) {
    cerr << "\e[31mix: negative index at line " << line << ", ix(" << code << ")\e[0m" << endl;
    exit(1);
  }
  int size = container.size();
  if (index >= size) {
    cerr << "\e[31mix: index out of range at line " << line << ", ix(" << code << ")\n"
      << "index = " << index << " whereas size = " << size << "\e[0m" << endl;
    exit(1);
  }
  return ix_impl(line, code, container[index], indices...);
}
#define ix(...) ix_impl(__LINE__, #__VA_ARGS__, __VA_ARGS__)
#endif
// }}}

// IO {{{
template <class T, class U>
ostream& operator<< (ostream& os, pair<T, U> p) {
  os << '(' << p.first << ", " << p.second << ')';
  return os;
}
template <class T, class U>
istream& operator>> (istream& is, pair<T, U>& p) {
  is >> p.first >> p.second;
  return is;
}
template <class T>
false_type is_container_impl(...);
template <class T, class = typename T::iterator>
true_type is_container_impl(T);
template <class T>
struct is_container : decltype(is_container_impl<T>(declval<T>())) {};
template <>
struct is_container <string> : std::false_type {};
template <class Container, class = enable_if_t<is_container<Container>{}>>
istream& operator>> (istream& is, Container& cont) {
  for (auto& v : cont) is >> v;
  return is;
}
template <class Container, class = enable_if_t<is_container<Container>{}>>
ostream& operator<< (ostream& os, Container const& cont) {
  bool first = true;
  constexpr char sep =
    is_container<typename Container::value_type>{} ? '\n' : ' ';
  for (auto const& v : cont) {
    if (!first) {
      os << sep;
    }
    first = false;
    os << v;
  }
  return os;
}
// }}}
// }}}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.precision(10);
  cout << fixed;
  Z N, K;
  cin >> N >> K;
  Z width = 2 * K;
  vector<vector<Z>> black(width + 1, vector<Z>(width + 1, 0)), white(width + 1, vector<Z>(width + 1, 0));
  for (auto i = 0; i < N; i++) {
    Z x, y;
    char c;
    cin >> x >> y >> c;
    x %= width;
    y %= width;
    if (c == 'B')
      ix(black, x + 1, y + 1) += 1;
    else
      ix(white, x + 1, y + 1) += 1;
  }
  debug {
    if (K < 20) {
      dump(black);
      dump(white);
    }
  }
  for (auto i = 0; i <= width; i++) {
    partial_sum(begin(ix(black, i)), end(ix(black, i)), begin(ix(black, i)));
    partial_sum(begin(ix(white, i)), end(ix(white, i)), begin(ix(white, i)));
  }
  for (auto i = 0; i < width; i++) {
    for (auto j = 0; j <= width; j++) {
      ix(black, i + 1, j) += ix(black, i, j);
      ix(white, i + 1, j) += ix(white, i, j);
    }
  }
  debug {
    if (K < 20) {
      dump(black);
      dump(white);
    }
  }
  Z ans = 0;
  for (auto i = 0; i <= K; i++) {
    for (auto j = 0; j <= K; j++) {
      Z cur = 0;
      cur += ix(black, width, width);
      cur -= ix(black, i + K, width);
      cur -= ix(black, width, j + K);
      cur += ix(black, i + K, j + K);

      cur += ix(black, i + K, j + K);
      cur -= ix(black, i + K, j);
      cur -= ix(black, i, j + K);
      cur += ix(black, i, j);

      cur += ix(black, i, width);
      cur -= ix(black, i, j + K);

      cur += ix(black, width, j);
      cur -= ix(black, i + K, j);

      cur += ix(black, i, j);

      cur += ix(white, i + K, width);
      cur -= ix(white, i + K, j + K);
      cur -= ix(white, i, width);
      cur += ix(white, i, j + K);

      cur += ix(white, width, j + K);
      cur -= ix(white, width, j);
      cur -= ix(white, i + K, j + K);
      cur += ix(white, i + K, j);

      cur += ix(white, i + K, j);
      cur -= ix(white, i, j);

      cur += ix(white, i, j + K);
      cur -= ix(white, i, j);

      debug {
        if (K < 20) {
          dump(i);
          dump(j);
          dump(cur);
        }
      }

      ans = max(ans, cur);
    }
  }
  for (auto i = 0; i <= K; i++) {
    for (auto j = 0; j <= K; j++) {
      Z cur = 0;
      cur += ix(white, width, width);
      cur -= ix(white, i + K, width);
      cur -= ix(white, width, j + K);
      cur += ix(white, i + K, j + K);

      cur += ix(white, i + K, j + K);
      cur -= ix(white, i + K, j);
      cur -= ix(white, i, j + K);
      cur += ix(white, i, j);

      cur += ix(white, i, width);
      cur -= ix(white, i, j + K);

      cur += ix(white, width, j);
      cur -= ix(white, i + K, j);

      cur += ix(white, i, j);

      cur += ix(black, i + K, width);
      cur -= ix(black, i + K, j + K);
      cur -= ix(black, i, width);
      cur += ix(black, i, j + K);

      cur += ix(black, width, j + K);
      cur -= ix(black, width, j);
      cur -= ix(black, i + K, j + K);
      cur += ix(black, i + K, j);

      cur += ix(black, i + K, j);
      cur -= ix(black, i, j);

      cur += ix(black, i, j + K);
      cur -= ix(black, i, j);

      debug {
        if (K < 20) {
          dump(i);
          dump(j);
          dump(cur);
        }
      }

      ans = max(ans, cur);
    }
  }
  cout << ans << endl;
}



Measured memory_bytes: 62976