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
N, K = map(int, input().split())

dp = [[0] * (3*K+1) for _ in range(2*K+1)]
for _ in range(N) :
    x, y, c = input().split()
    x, y = int(x), int(y)
    if c == 'W' :
        x += K
    
    m = min(x//K, y//K)
    x -= m * K
    y -= m * K
    x %= 2 * K
    y %= 2 * K
    
    dp[x][y] += 1
    if x < K and y < K :
        dp[x+K][y+K] += 1
        dp[x][y+2*K] += 1
    elif x < K and y >= K :
        dp[x+K][y-K] += 1
        dp[x+K][y+K] += 1
    elif x >= K and y < K :
        dp[x-K][y+K] += 1
        dp[x][y+2*K] += 1

for i in range(2 * K) :
    for j in range(3 * K) :
        dp[i][j] += dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1]
        
ret = 0
for i in range(K-1, 2 * K) :
    for j in range(K-1, 3 * K) :
        ret = max(ret, dp[i][j] - dp[i][j-K] - dp[i-K][j] + dp[i-K][j-K])
print(ret)