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
#include<cstdio>
#include<vector>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAXN=1005;
int map[MAXN][MAXN];
int n,k;
int main()
{
	scanf("%d %d",&n,&k);
	int mi=n,ma=0;
	for(int i=1;i<=n;i++)
	{
		long long xx=0,yy=0;
		char c;
		bool t;
		scanf("%I64d %I64d %c",&xx,&yy,&c);
		xx%=2*k;
		yy%=2*k;
		t=(c=='W')?0:1;
		if((xx<k&&k<=yy)||(k<=xx&&yy<k))
			t^=1;
		xx%=k;
		yy%=k;
		if(t==0)
		{
			map[xx][0]+=1;
			map[0][yy+1]+=1;
			map[xx][yy+1]-=2;
		}
		else
		{
			map[0][0]+=1;
			map[xx][0]-=1;
			map[0][yy+1]-=1;
			map[xx][yy+1]+=2;
		}
	}
	for(int i=0;i<k;i++)
	{
		for(int j=0;j<k;j++)
		{
			if(i>0)
				map[i][j]+=map[i-1][j];
			if(j>0)
				map[i][j]+=map[i][j-1];
			if(i>0&&j>0)
				map[i][j]-=map[i-1][j-1];
			ma=max(map[i][j],ma);
			mi=min(map[i][j],mi);
		}
	}
	int ans=max(ma,n-mi);
	printf("%d\n",ans);
}