#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <type_traits>
#include <cmath>
#include <cassert>
#include <cstdio>

using namespace std;
using namespace placeholders;

using LL = long long;
using ULL = unsigned long long;
using VI = vector< int >;
using VVI = vector< vector< int > >;
using VS = vector< string >;
using ISS = istringstream;
using OSS = ostringstream;
using PII = pair< int, int >;
using VPII = vector< pair< int, int > >;
template < typename T = int > using VT = vector< T >;
template < typename T = int > using VVT = vector< vector< T > >;
template < typename T = int > using LIM = numeric_limits< T >;

template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }
template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i ) << v[i]; } return s; }

void in_impl(){};
template < typename T, typename... TS > void in_impl( T &head, TS &... tail ){ cin >> head; in_impl( tail ... ); }
#define IN( T, ... ) T __VA_ARGS__; in_impl( __VA_ARGS__ );

template < typename T > struct getv_fmt;
template <> struct getv_fmt<       int >{ static constexpr const char *fmt = "%d"; };
template <> struct getv_fmt< long long >{ static constexpr const char *fmt = "%lld"; };
template < typename T > void getv( std::vector< T > &v ){ for_each( begin( v ), end( v ), []( T &a ){ scanf( getv_fmt< T >::fmt, &a ); } ); };

template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; }
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); }

#define NUMBERED( name, number ) NUMBERED2( name, number )
#define NUMBERED2( name, number ) name ## _ ## number
#define REP1( n ) REP2( NUMBERED( REP_COUNTER, __LINE__ ), n )
#define REP2( i, n ) REP3( i, 0, n )
#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )
#define GET_REP( a, b, c, F, ... ) F
#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2, REP1 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &&e : c )
#define ALL( c ) begin( c ), end( c )
#define AALL( a ) ( remove_all_extents< decltype( a ) >::type * )a, ( remove_all_extents< decltype( a ) >::type * )a + sizeof( a ) / sizeof( remove_all_extents< decltype( a ) >::type )
#define DRANGE( c, p ) begin( c ), begin( c ) + ( p ), end( c )

#define SZ( v ) ( (int)( v ).size() )
#define EXIST( c, e ) ( ( c ).find( e ) != ( c ).end() )

template < typename T > inline bool chmin( T &a, const T &b ){ if ( b < a ) { a = b; return true; } return false; }
template < typename T > inline bool chmax( T &a, const T &b ){ if ( a < b ) { a = b; return true; } return false; }

#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define MP make_pair
#define fst first
#define snd second

#define DUMP( x ) cerr << #x << " = " << ( x ) << endl


// いもす法による区間加算クエリ
// 加算 O( 1 )
// 集計 O( HW )
class Imos2d
{
private:
	const int H, W;
	vector< vector<int> > board, csum;
	bool solved;

public:
	Imos2d( const int h, const int w ) : H( h ), W( w ), board( H + 1, vector<int>( W + 1 ) ) {}

	void add( const int y1, const int x1, const int y2, const int x2, const int value )
	{
		board[ y1 ][ x1 ] += value;
		board[ y1 ][ x2 ] -= value;
		board[ y2 ][ x1 ] -= value;
		board[ y2 ][ x2 ] += value;

		solved = false;

		return;
	}

	int getValue( const int y, const int x )
	{
		if ( !solved )
		{
			solve();
		}
		return csum[y][x];
	}

private:
	void solve()
	{
		csum = board;

		for ( auto &row : csum )
		{
			partial_sum( row.begin(), row.end(), row.begin() );
		}

		for ( int i = 0; i < H; i++ )
		{
			for ( int j = 0; j <= W; j++ )
			{
				csum[ i + 1 ][j] += csum[i][j];
			}
		}

		solved = true;

		return;
	}
};
// imos2d( H, W )
// add( y1, x1, y2, x2, value ) : 半開区間
// getvalue( y, x )

VPII embedded( const int x1, const int x2, const int MOD )
{
	VPII res;
	if ( x1 <= x2 )
	{
		res.EB( x1, x2 );
	}
	else
	{
		res.EB( x1, MOD );
		res.EB( 0, x2 );
	}
	return move( res );
}

int main()
{
	cin.tie( 0 );
	ios::sync_with_stdio( false );
	cout << setprecision( 12 ) << fixed;

	IN( int, N, K );
	const int MOD = 2 * K;

	Imos2d imos( 2048, 2048 );
	
	REP( N )
	{
		IN( int, X, Y );
		IN( char, C );

		const int OFFSET = C == 'W' ? 0 : K;

		REP( i, 2 )
		{
			const int x1 = ( X + i * K          - ( K - 1 ) + 10 * MOD ) % MOD;
			const int y1 = ( Y + i * K + OFFSET - ( K - 1 ) + 10 * MOD ) % MOD;
			const int x2 = ( x1 + K ) % MOD;
			const int y2 = ( y1 + K ) % MOD;

			const auto xs = embedded( x1, x2, MOD );
			const auto ys = embedded( y1, y2, MOD );

			FOR( xx, xs )
			{
				FOR( yy, ys )
				{
					imos.add( yy.fst, xx.fst, yy.snd, xx.snd, 1 );
				}
			}
		}
	}

	int res = 0;
	REP( i, MOD )
	{
		REP( j, MOD )
		{
			chmax( res, imos.getValue( i, j ) );
		}
	}
	cout << res << endl;

	return 0;
}


Measured memory_bytes: 33152