Problem: AtCoDeer is thinking of painting an infinite two-dimensional grid in a checked pattern of side K. Here, a checked pattern of side K is a pattern where each square is painted black or white so that each connected component of each color is a K × K square. Below is an example of a checked pattern of side 3:

cba927b2484fad94fb5ff7473e9aadef.png

AtCoDeer has N desires. The i-th desire is represented by x_i, y_i and c_i. If c_i is `B`, it means that he wants to paint the square (x_i,y_i) black; if c_i is `W`, he wants to paint the square (x_i,y_i) white. At most how many desires can he satisfy at the same time?

Constraints

* 1 ≤ N ≤ 10^5
* 1 ≤ K ≤ 1000
* 0 ≤ x_i ≤ 10^9
* 0 ≤ y_i ≤ 10^9
* If i ≠ j, then (x_i,y_i) ≠ (x_j,y_j).
* c_i is `B` or `W`.
* N, K, x_i and y_i are integers.

Input

Input is given from Standard Input in the following format:


N K
x_1 y_1 c_1
x_2 y_2 c_2
:
x_N y_N c_N


Output

Print the maximum number of desires that can be satisfied at the same time.

Examples

Input

4 3
0 1 W
1 2 W
5 3 B
5 4 B


Output

4


Input

2 1000
0 0 B
0 1 W


Output

2


Input

6 2
1 2 B
2 1 W
2 2 B
1 0 B
0 6 W
4 5 W


Output

4

Solution (in CPP):

Solution:
#include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;

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

  vector<vector<int>> csum(2 * K + 1, vector<int>(2 * K + 1, 0));
  for (int y = 0; y < 2 * K; ++y) {
    for (int x = 0; x < 2 * K; ++x) {
      csum[y + 1][x + 1] =
          csum[y + 1][x] + csum[y][x + 1] - csum[y][x] + G[y][x];
    }
  }

  int answer = 0;
  for (int y = 0; y <= K; ++y) {
    for (int x = 0; x <= K; ++x) {
      int sum = csum[y][x];
      sum += csum[2 * K][x] - csum[K + y][x];
      sum += csum[y][2 * K] - csum[y][K + x];
      sum += csum[K + y][K + x] + csum[y][x] - csum[K + y][x] - csum[y][K + x];
      sum += csum[2 * K][2 * K] + csum[K + y][K + x] - csum[2 * K][K + x] -
             csum[K + y][2 * K];
      answer = max(answer, sum);
      answer = max(answer, N - sum);
    }
  }
  cout << answer << endl;
  return 0;
}