output_description: Print the maximum number of desires that can be satisfied at the same time.
  
  * * *
input_description: 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
attempt: n, k = map(int, input().split())
  l = []
  for i in range(n):
      a = list(input().split())
      l.append(a)
  l1 = [[0, 1, 5], [0, 1, 2], [4, 5, 0]]
  l2 = [[2, 3, 4], [3, 4, 5], [1, 2, 3]]
  count = [0 for i in range(18)]
  for i in range(n):
      p = int(l[i][0])
      q = int(l[i][1])
      if p < 0:
          p1 = 6 - ((abs(p)) % 6)
          if p1 == 6:
              p1 = 0
      else:
          p1 = p % 6
      if q < 0:
          q1 = 6 - ((abs(q)) % 6)
          if q1 == 6:
              q1 = 0
      else:
          q1 = q % 6
      c = 0
      for j in range(3):
          for x in range(3):
              if p1 in l1[j]:
                  if q1 in l1[x]:
                      if l[i][2] == "W":
                          count[c] += 1
                      else:
                          count[9 + c] += 1
                  else:
                      if l[i][2] == "B":
                          count[c] += 1
                      else:
                          count[9 + c] += 1
              else:
                  if q1 in l1[x]:
                      if l[i][2] == "B":
                          count[c] += 1
                      else:
                          count[9 + c] += 1
                  else:
                      if l[i][2] == "W":
                          count[c] += 1
                      else:
                          count[9 + c] += 1
              c += 1
  print(max(count))
  
problem_description: 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:
  
  ![cba927b2484fad94fb5ff7473e9aadef.png](https://img.atcoder.jp/arc089/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?
samples: [{"input": "4 3\n    0 1 W\n    1 2 W\n    5 3 B\n    5 4 B", "output": "4\n    \n\nHe can satisfy all his desires by painting as shown in the example above.\n\n* * *"}, {"input": "2 1000\n    0 0 B\n    0 1 W", "output": "2\n    \n\n* * *"}, {"input": "6 2\n    1 2 B\n    2 1 W\n    2 2 B\n    1 0 B\n    0 6 W\n    4 5 W", "output": "4"}]