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
//package com.company;

import java.io.*;
import java.util.*;

public class Main {
    static long TIME_START, TIME_END;
    public static void main(String[] args) throws IOException {
        MyScanner sc = new MyScanner(System.in);
//        MyScanner sc = new MyScanner(new FileInputStream("Test.in"));
        PrintWriter pw = new PrintWriter(System.out);
        TIME_START = System.currentTimeMillis();
        Task.solve(sc, pw);
        TIME_END = System.currentTimeMillis();
//        pw.println("Time used: " + (TIME_END - TIME_START) + ".");
        pw.close();
    }

    public static class Task {
        static int n;
        static int k;
        static int[] xi;
        static int[] yi;
        static int[][] countLD;
        static int[][] gridPoint;
        static int getBlock(int x, int y) {
            int xx = Math.min(x + k - 1, 4 * k);
            int yy = Math.min(y + k - 1, 4 * k);
            int t = countLD[xx][yy] - countLD[x - 1][yy] - countLD[xx][y - 1] + countLD[x - 1][y - 1];
            return t;
        }
        public static void solve(MyScanner sc, PrintWriter pw) throws IOException {
            n = sc.nextInt();
            k = sc.nextInt();
            xi = new int[n];
            yi = new int[n];
            countLD = new int[4 * k + 2][4 * k + 2];
            gridPoint = new int[2 * k + 2][2 * k + 2];
            for (int i = 0; i < n; i++) {
                int x = sc.nextInt();
                int y = sc.nextInt();
                char c = sc.next().charAt(0);
                if (c == 'B') {
                    x += k;
                }
                x %= (2 * k);
                y %= (2 * k);
                gridPoint[x + 1][y + 1]++;
            }
            for (int i = 1 + k; i <= 4 * k; i++) {
                for (int j = 1 + k; j <= 4 * k; j++) {
                    countLD[i][j] = countLD[i - 1][j] + countLD[i][j - 1] - countLD[i - 1][j - 1];
                    if (i - k <= 2 * k + 1 && j - k <= 2 * k + 1) {
                        countLD[i][j] += gridPoint[i - k][j - k];
                    }
                }
            }
            int max = 0;
            for (int i = k + 1; i <= 3 * k; i++) {
                for (int j = k + 1; j <= 3 * k; j++) {
                    if (i > 2 * k && j > 2 * k) continue;
                    int c = 0;
                    c += getBlock(i, j);
                    c += getBlock(i - k, j - k);
                    c += getBlock(i + k, j - k);
                    c += getBlock(i - k, j + k);
                    c += getBlock(i + k, j + k);
                    max = Math.max(max, c);
                    if (i <= 2 * k && j <= 2 * k) {
                        max = Math.max(max, n - c);

                    }
                }
            }
            pw.println(max);
        }

    }

    static class MyScanner {
        StringTokenizer st;
        BufferedReader br;

        public MyScanner(InputStream s){  br = new BufferedReader(new InputStreamReader(s));}

        public MyScanner(FileReader s) throws FileNotFoundException {br = new BufferedReader(s);}

        public String next() throws IOException
        {
            while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }

        public int nextInt() throws IOException {return Integer.parseInt(next());}

        public long nextLong() throws IOException {return Long.parseLong(next());}

        public String nextLine() throws IOException {return br.readLine();}

        public double nextDouble() throws IOException { return Double.parseDouble(next()); }

        public boolean ready() throws IOException {return br.ready();}
    }
}
