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 {
    int data[][], k2;

    private class Point {
        int x, y;

        public Point(int x, int y) {
            this.x = x;
            this.y = y;
        }
    }

    public void main(Scanner sc) {
        int n = sc.nextInt();
        int k = sc.nextInt();
        k2 = 2 * k;
        Point p[] = new Point[n];
        for (int i = 0; i < n; i++) {
            int x = sc.nextInt() % k2;
            int y = sc.nextInt() % k2;
            if (!sc.next().equals("B")) {
                y = (y + k) % k2;
            }
            p[i] = new Point(x, y);
        }

        data = new int[k2][k2];
        for (int i = 0; i < n; i++) {
            add(-p[i].x, -p[i].y, 1);
            add(k - p[i].x, k - p[i].y, 1);
            add(-p[i].x, k - p[i].y, -1);
            add(k - p[i].x, -p[i].y, -1);
            add(k - p[i].x, k - p[i].y, 1);
            add(k2 - p[i].x, k2 - p[i].y, 1);
            add(k - p[i].x, k2 - p[i].y, -1);
            add(k2 - p[i].x, k - p[i].y, -1);
        }

        for (int i = 0; i < k2; i++) {
            for (int j = 1; j < k2; j++) {
                data[i][j] += data[i][j - 1];
            }
        }
        for (int i = 0; i < k2; i++) {
            for (int j = 1; j < k2; j++) {
                data[j][i] += data[j - 1][i];
            }
        }

        int ans = 0;
        for (int i = 0; i < k2; i++) {
            for (int j = 0; j < k2; j++) {
                ans = Math.max(ans, data[i][j]);
            }
        }
        System.out.println(ans);
    }

    private void add(int x, int y, int n) {
        if (x >= 0 && x < k2) {
            if (y >= 0 && y < k2) {
                data[y][x] += n;
            } else if (y < 0) {
                data[0][x] += n;
                data[k2 + y][x] += n;
            }
        } else if (x < 0) {
            if (y >= 0 && y < k2) {
                data[y][0] += n;
                data[y][k2 + x] += n;
            } else if (y < 0) {
                data[0][0] += n;
                data[0][k2 + x] += n;
                data[k2 + y][0] += n;
                data[k2 + y][k2 + x] += n;
            }
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        new Main().main(sc);
        sc.close();
    }
}
