import java.io.{BufferedReader, IOException, InputStream, InputStreamReader}
import java.util.StringTokenizer

import scala.util.Sorting

object Main {
  def solve(): Unit = {
    val sc = new InputReader(System.in)
    val N = sc.nextInt()
    val K = sc.nextInt()
    val m = 2 * K
    val c = Array.ofDim[Int](m, m)

    (0 until N) foreach { _ =>
      val x = sc.nextInt()
      val y = sc.nextInt()
      sc.nextChar() match {
        case 'W' => c(x % m)(y % m) += 1
        case 'B' => c((x % m + K) % m)(y % m) += 1
      }
    }

    val sums = Array.ofDim[Int](m, m)    // (x, y)から(x+K, y)までのsum
    (0 until m) foreach { y =>
      sums(0)(y) = ((0 until K) map (x => c(x)(y))).sum
    }
    for {
      x <- 1 until m
      y <- 0 until m
    } {
      sums(x)(y) = sums(x - 1)(y) + c((x + K - 1) % m)(y) - c(x - 1)(y)
    }

    def w1(x: Int, y: Int) = sums(x % m)(y % m)
    def w2(x: Int, y: Int) = sums((x + K) % m)((y + K) % m)

    var ans = 0
    (0 until m) foreach { x =>
      var sum1 = ((0 until K) map (y => w1(x, y))).sum
      var sum2 = ((0 until K) map (y => w2(x, y))).sum
      ans = math.max(ans, sum1 + sum2)
      (1 until m) foreach { y =>
        sum1 -= w1(x, y - 1)
        sum1 += w1(x, y + K - 1)
        sum2 -= w2(x, y - 1)
        sum2 += w2(x, y + K - 1)
        ans = math.max(ans, sum1 + sum2)
      }
    }
    println(ans)
  }

  def main(args: Array[String]): Unit = {
    solve()
  }

  class InputReader(val stream: InputStream) {
    val reader = new BufferedReader(new InputStreamReader(stream), 32768)
    var tokenizer: StringTokenizer = null

    def next: String = {
      while (tokenizer == null || !tokenizer.hasMoreTokens)
        tokenizer = new StringTokenizer(reader.readLine)
      tokenizer.nextToken
    }

    def nextInt(): Int = next.toInt
    def nextChar(): Char = next.charAt(0)
  }
}
