Problem:
Score : 500 points

Problem Statement

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:

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.

Sample Input 1

4 3
0 1 W
1 2 W
5 3 B
5 4 B

Sample Output 1

4

He can satisfy all his desires by painting as shown in the example above.

Sample Input 2

2 1000
0 0 B
0 1 W

Sample Output 2

2

Sample Input 3

6 2
1 2 B
2 1 W
2 2 B
1 0 B
0 6 W
4 5 W

Sample Output 3

4

Solution in C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.Collections.Generic;
using System.Text;

namespace AtTest.D_Challenge
{
    class ABC_086
    {
        static void Main(string[] args)
        {
            Method(args);
            Console.ReadLine();
        }

        static void Method(string[] args)
        {
            int[] nk = ReadInts();
            int n = nk[0];
            int k = nk[1];
            var blacks = new int[n][];//すべてbに落とし込む
            var blackGrid = new int[k * 2, k * 2];
            var bws = new int[n][];
            for (int i = 0; i < n; i++)
            {
                string[] input = Read().Split(' ');
                int x = int.Parse(input[0]) % (k * 2);
                int y = int.Parse(input[1]) % (k * 2);
                bool black = input[2][0] == 'B';
                if (!black)
                {
                    x += k;
                    x %= k * 2;
                }
                blacks[i] = new int[2] { x, y };
                blackGrid[x, y]++;
            }
            var blackSums = new int[k * 2, k * 2];//x,yに黒の起点があるときの個数
            for(int x=0; x < k * 2; x++)//2次元累積和
            {
                for (int y = 0; y < k * 2; y++)
                {
                    blackSums[x, y] = blackGrid[x, y];

                    if (x > 0)
                    {
                        blackSums[x, y] += blackSums[x - 1, y];
                    }
                    if (y > 0)
                    {
                        blackSums[x, y] += blackSums[x, y - 1];
                    }
                    if (x > 0 && y > 0)
                    {
                        blackSums[x, y] -= blackSums[x - 1, y - 1];
                    }
                }
            }

            int max = 0;
            for (int x = 0; x < k * 2; x++)
            {
                for (int y = 0; y < k * 2; y++)
                {
                    if (k <= x && k <= y) continue;
                    int cnt = 0;
                    cnt += RectSum(blackSums, x, y, k);
                    cnt += RectSum(blackSums, x + k, y + k, k);
                    cnt += RectSum(blackSums, x - k, y - k, k);
                    cnt += RectSum(blackSums, x + k, y - k, k);
                    cnt += RectSum(blackSums, x - k, y + k, k);
                    max = Math.Max(max, cnt);
                }
            }
            Console.WriteLine(max);
        }

        static int RectSum(int[,] sumGrid, int x, int y, int k)
        {
            int xR = Math.Min(x + k - 1, k * 2 - 1);
            int yR = Math.Min(y + k - 1, k * 2 - 1);
            if (xR < 0 || yR < 0) return 0;
            if (k * 2 <= x || k * 2 <= y) return 0;
            int sum = sumGrid[xR, yR];
            if (0 < y)
            {
                sum -= sumGrid[xR, y - 1];
            }
            if (0 < x)
            {
                sum -= sumGrid[x - 1, yR];
            }
            if (0 < x && 0 < y)
            {
                sum += sumGrid[x - 1, y - 1];
            }
            return sum;
        }

        private static string Read() { return Console.ReadLine(); }
        private static int ReadInt() { return int.Parse(Read()); }
        private static long ReadLong() { return long.Parse(Read()); }
        private static double ReadDouble() { return double.Parse(Read()); }
        private static int[] ReadInts() { return Array.ConvertAll(Read().Split(), int.Parse); }
        private static long[] ReadLongs() { return Array.ConvertAll(Read().Split(), long.Parse); }
        private static double[] ReadDoubles() { return Array.ConvertAll(Read().Split(), double.Parse); }
    }
}