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 PYTHON3):

Solution:
N,K=map(int,input().split())
x=[0 for i in range(N)]
y=[0 for i in range(N)]
for i in range(N):
    a,b,c=map(str,input().split())
    a,b=int(a),int(b)
    if c=="W":
        b+=K
    a%=(2*K)
    b%=(2*K)
    x[i]=a
    y[i]=b
board=[[0 for j in range(2*K+1)] for i in range(2*K+1)]
for i in range(N):
    if y[i]>=K:
        y[i]-=K
        x[i]=(x[i]+K)%(2*K)
    if x[i]>=K and y[i]<K:
        board[0][y[i]+1]+=1
        board[0][y[i]+K+1]-=1
        board[x[i]-K+1][y[i]+1]-=2
        board[x[i]-K+1][y[i]+K+1]+=2
        board[x[i]-K+1][0]+=1
        board[x[i]+1][0]-=1
        board[x[i]+1][y[i]+1]+=2
        board[x[i]+1][y[i]+K+1]-=2
    if x[i]<K and y[i]<K:
        board[0][y[i]+1]-=1
        board[0][y[i]+K+1]+=1
        board[x[i]+K+1][y[i]+1]-=2
        board[x[i]+K+1][y[i]+K+1]+=2
        board[x[i]+K+1][0]+=1
        board[x[i]+1][0]-=1
        board[x[i]+1][y[i]+1]+=2
        board[x[i]+1][y[i]+K+1]-=2
        board[0][0]+=1
coard=[[0 for j in range(2*K)] for i in range(2*K)]
doard=[[0 for j in range(2*K)] for i in range(2*K)]
for i in range(2*K):
    for j in range(2*K):
        if i==0:
            coard[i][j]=board[i][j]
        else:
            coard[i][j]=board[i][j]+coard[i-1][j]
for i in range(2*K):
    for j in range(2*K):
        if j==0:
            doard[i][j]=coard[i][j]
        else:
            doard[i][j]=coard[i][j]+doard[i][j-1]
ans=0
for i in range(2*K):
    for j in range(2*K):
        ans=max(ans,doard[i][j])
print(ans)