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
import java.util.*;

public class Main{
    
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        
        int n = sc.nextInt();
        int k = sc.nextInt();
        sc.nextLine();
        
        int[][] grd = new int[k*2+1][k*2+1];
        
        for(int i=0; i<n; i++){
            String[] xyc = sc.nextLine().split(" ");
            int x = Integer.parseInt(xyc[0]);
            int y = Integer.parseInt(xyc[1]);
            if(xyc[2].charAt(0) == 'W'){
                y += k;
            }
            grd[y%(k*2)+1][x%(k*2)+1] += 1;
        }
        
        /*
        for(int i=0; i<k*2; i++){
            for(int j=0; j<k*2; j++){
                System.out.print(grd[i][j]);
            }
            System.out.println("");
        }
        */
        
        for(int i=0; i<k*2+1; i++){
            for(int j=0; j<k*2; j++){
                grd[i][j+1] += grd[i][j];
            }
        }
        
        for(int i=0; i<k*2; i++){
            for(int j=0; j<k*2+1; j++){
                grd[i+1][j] += grd[i][j];
            }
        }
        
        int all = grd[k*2][k*2];
        int ans = 0;
        for(int i=0; i<k; i++){
            for(int j=0; j<k; j++){
                int cnt = 0;
                //iki jkj
                cnt += njrisum(grd, i, j, k, k);
                //i0 j0
                cnt += njrisum(grd, 0, 0, i, j);
                //k2i j0
                cnt += njrisum(grd, i+k, 0, k-i, j);
                //i0 k2j
                cnt += njrisum(grd, 0, j+k, i, k-j);
                //k2i k2j
                cnt += njrisum(grd, i+k, j+k, k-i, k-j);
                
                if(ans < cnt) ans = cnt;
                if(ans < all - cnt) ans = all - cnt;
            }
        }
        
        System.out.println(ans);
    }
    
    public static int njrisum(int[][]grd, int i, int j, int h, int w){
        if(h==0 || w==0){
            return 0;
        }
        return grd[i + h][j + w] - grd[i][j + w] - grd[i + h][j] + grd[i][j];
    }
}
