import std.stdio;
import std.string;
import std.conv;
import std.typecons;
import std.algorithm;
import std.functional;
import std.bigint;
import std.numeric;
import std.array;
import std.math;
import std.range;
import std.container;
import std.ascii;
import std.concurrency;
import core.bitop : popcnt;
alias Generator = std.concurrency.Generator;

const long INF = long.max/3;
const long MOD = 10L^^9+7;

void main() {
    int N, K;
    scanln(N, K);

    long[][] cnt = new long[][](2*K+1, 2*K+1);

    foreach(_; 0..N) {
        string[] input = readln.split.array;
        long x = input[0].to!int;
        long y = input[1].to!int;
        char c = input[2].to!char;
        if (c == 'B') {
            void f1(int k, int il, int ir) {
                if (il > ir) {
                    f1(k, 0, ir);
                    f1(k, il, 2*K);
                } else {
                    int jl, jr;
                    if (k%2 == 0) {
                        jl = (x-K+1 + K + 2*K) % (2*K);
                        jr = (jl + K)%(2*K);
                    } else {
                        jl = (x-K+1 + 2*K) % (2*K);
                        jr = (jl + K)%(2*K);
                    }
                    if (jl < jr) {
                        cnt[il][jl]++;
                        cnt[ir][jl]--;
                        cnt[il][jr]--;
                        cnt[ir][jr]++;
                    } else {
                        cnt[il][0]++;
                        cnt[ir][0]--;
                        cnt[il][jr]--;
                        cnt[ir][jr]++;

                        cnt[il][jl]++;
                        cnt[ir][jl]--;
                        cnt[il][2*K]--;
                        cnt[ir][2*K]++;
                    }
                }
            }
            int l = ((K-y)%(2*K) + 2*K) % (2*K);
            int r = (l + K)%(2*K);
            f1(0, l, r);
            f1(1, (l+K)%(2*K), (r+K)%(2*K));
        } else {
            void f2(int k, int il, int ir) {
                if (il > ir) {
                    f2(k, 0, ir);
                    f2(k, il, 2*K);
                } else {
                    int jl, jr;
                    if (k%2 == 0) {
                        jl = (x-K+1 + 2*K) % (2*K);
                        jr = (jl + K)%(2*K);
                    } else {
                        jl = (x-K+1 + K + 2*K) % (2*K);
                        jr = (jl + K)%(2*K);
                    }
                    if (jl < jr) {
                        cnt[il][jl]++;
                        cnt[ir][jl]--;
                        cnt[il][jr]--;
                        cnt[ir][jr]++;
                    } else {
                        cnt[il][0]++;
                        cnt[ir][0]--;
                        cnt[il][jr]--;
                        cnt[ir][jr]++;

                        cnt[il][jl]++;
                        cnt[ir][jl]--;
                        cnt[il][2*K]--;
                        cnt[ir][2*K]++;
                    }
                }
            }
            int l = ((K-y)%(2*K) + 2*K) % (2*K);
            int r = (l + K)%(2*K);
            f2(0, l, r);
            f2(1, (l+K)%(2*K), (r+K)%(2*K));
        }
    }

    foreach(i; 0..2*K+1) {
        if (i<2*K) cnt[i+1][] += cnt[i][];
        foreach(j; 0..2*K) {
            cnt[i][j+1] += cnt[i][j];
        }
    }
    cnt.map!(as => as.reduce!max).reduce!max.writeln;
}

// ----------------------------------------------

void scanln(Args...)(ref Args args) {
    foreach(i, ref v; args) {
        "%d".readf(&v);
        (i==args.length-1 ? "\n" : " ").readf;
    }
    // ("%d".repeat(args.length).join(" ") ~ "\n").readf(args);
}

void times(alias fun)(int n) {
    // n.iota.each!(i => fun());
    foreach(i; 0..n) fun();
}
auto rep(alias fun, T = typeof(fun()))(int n) {
    // return n.iota.map!(i => fun()).array;
    T[] res = new T[n];
    foreach(ref e; res) e = fun();
    return res;
}

T ceil(T)(T x, T y) if (__traits(isIntegral, T)) {
    // `(x+y-1)/y` will only work for positive numbers ...
    T t = x / y;
    if (t * y < x) t++;
    return t;
}

T floor(T)(T x, T y) if (__traits(isIntegral, T)) {
    T t = x / y;
    if (t * y > x) t--;
    return t;
}

// fold was added in D 2.071.0
static if (__VERSION__ < 2071) {
    template fold(fun...) if (fun.length >= 1) {
        auto fold(R, S...)(R r, S seed) {
            static if (S.length < 2) {
                return reduce!fun(seed, r);
            } else {
                return reduce!fun(tuple(seed), r);
            }
        }
    }
}

// cumulativeFold was added in D 2.072.0
static if (__VERSION__ < 2072) {
    template cumulativeFold(fun...)
    if (fun.length >= 1)
    {
        import std.meta : staticMap;
        private alias binfuns = staticMap!(binaryFun, fun);

        auto cumulativeFold(R)(R range)
        if (isInputRange!(Unqual!R))
        {
            return cumulativeFoldImpl(range);
        }

        auto cumulativeFold(R, S)(R range, S seed)
        if (isInputRange!(Unqual!R))
        {
            static if (fun.length == 1)
                return cumulativeFoldImpl(range, seed);
            else
                return cumulativeFoldImpl(range, seed.expand);
        }

        private auto cumulativeFoldImpl(R, Args...)(R range, ref Args args)
        {
            import std.algorithm.internal : algoFormat;

            static assert(Args.length == 0 || Args.length == fun.length,
                algoFormat("Seed %s does not have the correct amount of fields (should be %s)",
                    Args.stringof, fun.length));

            static if (args.length)
                alias State = staticMap!(Unqual, Args);
            else
                alias State = staticMap!(ReduceSeedType!(ElementType!R), binfuns);

            foreach (i, f; binfuns)
            {
                static assert(!__traits(compiles, f(args[i], e)) || __traits(compiles,
                        { args[i] = f(args[i], e); }()),
                    algoFormat("Incompatible function/seed/element: %s/%s/%s",
                        fullyQualifiedName!f, Args[i].stringof, E.stringof));
            }

            static struct Result
            {
            private:
                R source;
                State state;

                this(R range, ref Args args)
                {
                    source = range;
                    if (source.empty)
                        return;

                    foreach (i, f; binfuns)
                    {
                        static if (args.length)
                            state[i] = f(args[i], source.front);
                        else
                            state[i] = source.front;
                    }
                }

            public:
                @property bool empty()
                {
                    return source.empty;
                }

                @property auto front()
                {
                    assert(!empty, "Attempting to fetch the front of an empty cumulativeFold.");
                    static if (fun.length > 1)
                    {
                        import std.typecons : tuple;
                        return tuple(state);
                    }
                    else
                    {
                        return state[0];
                    }
                }

                void popFront()
                {
                    assert(!empty, "Attempting to popFront an empty cumulativeFold.");
                    source.popFront;

                    if (source.empty)
                        return;

                    foreach (i, f; binfuns)
                        state[i] = f(state[i], source.front);
                }

                static if (isForwardRange!R)
                {
                    @property auto save()
                    {
                        auto result = this;
                        result.source = source.save;
                        return result;
                    }
                }

                static if (hasLength!R)
                {
                    @property size_t length()
                    {
                        return source.length;
                    }
                }
            }

            return Result(range, args);
        }
    }
}

// minElement/maxElement was added in D 2.072.0
static if (__VERSION__ < 2072) {
    auto minElement(alias map, Range)(Range r)
    if (isInputRange!Range && !isInfinite!Range)
    {
        alias mapFun = unaryFun!map;
        auto element = r.front;
        auto minimum = mapFun(element);
        r.popFront;
        foreach(a; r) {
            auto b = mapFun(a);
            if (b < minimum) {
                element = a;
                minimum = b;
            }
        }
        return element;
    }
    auto maxElement(alias map, Range)(Range r)
    if (isInputRange!Range && !isInfinite!Range)
    {
        alias mapFun = unaryFun!map;
        auto element = r.front;
        auto maximum = mapFun(element);
        r.popFront;
        foreach(a; r) {
            auto b = mapFun(a);
            if (b > maximum) {
                element = a;
                maximum = b;
            }
        }
        return element;
    }
}


Measured memory_bytes: 34812