#include <bits/stdc++.h>

using namespace std;

#define iter(v) v.begin(), v.end()
#define SZ(v) (int)v.size()
#define pb emplace_back
#define ff first
#define ss second

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

#ifdef zisk
void debug(){cout << endl;}
template<class T, class ... U>
void debug(T a, U ... b){cout << a << " ", debug(b...);}
template<class T> void pary(T l, T r){
	while(l != r) cout << *l << " ", l++;
	cout << endl;	
}
#else
#define debug(...) void()
#define pary(...) void()
#endif

template<class A, class B>
ostream& operator<<(ostream& o, pair<A, B> p){
	return o << '(' << p.ff << ',' << p.ss << ')';
}

const ll MOD = 998244353;

vector<ll> fac(105);
vector<ll> invf(105);

ll inv(ll a){
	ll b = MOD - 2;
	ll ans = 1;
	while(b > 0){
		if(b & 1) ans = ans * a % MOD;
		a = a * a % MOD;
		b >>= 1;
	}
	return ans;
}

void init(){
	fac[0] = invf[0] = 1;
	for(int i = 1; i < 105; i++){
		fac[i] = fac[i - 1] * i % MOD;
		invf[i] = inv(fac[i]);
	}
}

ll C(int n, int k){
	return fac[n] * invf[k] % MOD * invf[n - k] % MOD;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);

	init();

	int n, m;
	cin >> n >> m;

	vector<pll> fix(n);
	int black = 0;
	for(int i = 0; i < n; i++){
		cin >> fix[i].ff;
		string s;
		cin >> s;
		if(s == "BLACK") fix[i].ss = 1, black++;
		else fix[i].ss = 0;
	}
	sort(iter(fix));
	fix.pb(pii(fix.back().ff + 1e9, fix.back().ss));
	pary(iter(fix));

	vector<ll> ps(m);
	for(int i = 0; i < m; i++) cin >> ps[i];
	sort(iter(ps));
	
	vector<int> grp;

	vector<ll> knap(m + 1);
	knap[0] = 1;

	int ptr = 0;
	for(int t = 0; t < n; t++){
		vector<ll> p;
		p.pb(fix[t].ff);
		while(ptr < m && ps[ptr] <= fix[t + 1].ff)
			p.pb(ps[ptr++]);
		p.pb(fix[t + 1].ff);

		grp.pb(SZ(p) - 2);
		int c1 = fix[t].ss, c2 = fix[t + 1].ss;
		debug("test", c1, c2, fix[t].ff, fix[t + 1].ff);
		pary(iter(p));

		int sz = SZ(p);
		vector<vector<vector<ll>>> dp(sz, vector<vector<ll>>(sz, vector<ll>(sz + 1)));
		for(int i = 0; i + 1 < sz; i++){
			dp[i][i + 1][0] = 1;
		}

		for(int len = 2; len < sz; len++){
			for(int l = 0; l + len < sz; l++){
				int r = l + len;
				ll lx = p[l], rx = p[r];
				for(int mid = l + 1; mid < r; mid++){
					ll mx = p[mid];
					if(mx - lx <= rx - mx){
						int b1 = c1 == 1 ? mid - l : 0;
						debug("ok left", l, r, mid, b1);
						for(int b = 0; b < sz; b++){
							if(b - b1 < 0) continue;
							debug("b", b, ":", dp[mid][r][b - b1], C(r - l - 2, mid - l - 1), fac[mid - l - 1]);
							dp[l][r][b] += dp[mid][r][b - b1] * C(r - l - 2, mid - l - 1) % MOD * fac[mid - l - 1] % MOD;
							dp[l][r][b] %= MOD;
						}
					}
					else{
						int b2 = c2 == 1 ? r - mid : 0;
						debug("ok right", l, r, mid, b2);
						for(int b = 0; b < sz; b++){
							if(b - b2 < 0) continue;
							debug("b", b, ":", dp[l][mid][b - b2] * C(r - l - 2, r - mid - 1) % MOD * fac[r - mid - 1] % MOD);
							dp[l][r][b] += dp[l][mid][b - b2] * C(r - l - 2, r - mid - 1) % MOD * fac[r - mid - 1] % MOD;
							dp[l][r][b] %= MOD;
						}
					}
				}
				debug("dp", l, r);
				pary(iter(dp[l][r]));
			}
		}

		vector<ll> knap2(m + 1);
		for(int b = 0; b <= sz; b++){
			debug("dp", b, dp[0][sz - 1][b]);
			for(int i = 0; i + b <= m; i++){
				//debug("test", b, dp[0][sz - 1][b], "->", i, knap[i] * dp[0][sz - 1][b] % MOD);
				knap2[i + b] += knap[i] * dp[0][sz - 1][b] % MOD;
				knap2[i + b] %= MOD;
			}
		}
		knap.swap(knap2);
	}

	ll ans = 0;
	for(int b = 0; b <= m; b++){
		int r = n + m - b - black;
		if(r > b + black){
			ans += knap[b];
			ans %= MOD;
		}
	}
	ans = ans * fac[m] % MOD;
	for(int i : grp){
		ans = ans * invf[i] % MOD;
	}
	cout << ans << "\n";

}