#include <iostream>
#include <cstdio>
#include <vector>
#include <utility>
#include <string>
#include <algorithm>
#define mn 105
#define p 998244353

using namespace std;

int n, m, N, cnt[5], fac[mn], inv[mn];

int f[mn][mn], gg[mn][mn][55][2][2], num[mn];

vector<pair<int, int> > v;

int Pow(int a, int b) {
	int ans = 1;
	for(; b; b & 1 ? ans = 1ll * ans * a % p : 0, a = 1ll * a * a % p, b >>= 1);
	return ans;
}
int C(int n, int m) {
	if(n < 0 || m < 0 || n < m) return 0;
	return 1ll * fac[n] * inv[m] % p * inv[n - m] % p;
}

void Inc(int &a, int b) {
	if((a += b) >= p) a -= p;
}

int g(int l, int r, int k, int tl, int tr, int pl, int pr) {
	if(gg[l][r][k][tl][tr]) return gg[l][r][k][tl][tr];
	if(l > r) return gg[l][r][k][tl][tr] = k == 0;
	int t = tl, res = 0;
	for(int i = l; i <= r; ++i) {
		if(abs(v[i].first - pr) < abs(v[i].first - pl)) {
			t = tr;
		}
		int K = k - (t == 0);
		// printf("%d %d %d %d %d %d %d\n", l, r, v[i].first, K, t, max(0, K - (r - i)), min(i - l, K));
		for(int kk = max(0, K - (r - i)); kk <= min(i - l, K); ++kk) {
			Inc(res, 1ll * g(l, i - 1, kk, tl, t, pl, v[i].first) * g(i + 1, r, K - kk, t, tr, v[i].first, pr) % p * C(r - l, i - l) % p);
		}
	}
	// printf("%d %d %d %d %d %d %d %d\n", l, r, k, tl, tr, pl, pr, res);
	return gg[l][r][k][tl][tr] = res;
}

int main() {
	cin >> n >> m;
	N = n + m;
	fac[0] = 1;
	for(int i = 1; i <= N; ++i) {
		fac[i] = 1ll * fac[i - 1] * i % p;
	}
	inv[N] = Pow(fac[N], p - 2);
	for(int i = N - 1; i >= 0; --i) {
		inv[i] = 1ll * inv[i + 1] * (i + 1) % p;
	}
	int mx = 0;
	for(int i = 1; i <= n; ++i) {
		int x;
		string s;
		cin >> x >> s;
		mx = max(mx, x);
		int t = s == "BLACK";
		++cnt[t];
		v.push_back(make_pair(x, t));
	}
	sort(v.begin(), v.end());
	int tt = v[(int)v.size() - 1].second;
	v.push_back(make_pair(-1, v[0].second));
	for(int i = 1; i <= m; ++i) {
		int x;
		cin >> x;
		mx = max(mx, x);
		v.push_back(make_pair(x, 2));
	}
	v.push_back(make_pair(mx + 1, tt));
	sort(v.begin(), v.end());

	num[0] = 0;
	for(int i = 1; i < (int)v.size(); ++i) {
		num[i] = num[i - 1];
		if(v[i].second == 2) ++num[i];
	}
	f[0][0] = 1;
	int pre = 0;
	for(int i = 1; i < (int)v.size(); ++i) {
		if(v[i].second < 2) {
			for(int j = 0; j <= m; ++j) {
				// printf("%d %d %d %d\n", i, pre, num[i], num[pre]);
				for(int k = 0; k <= min(j, num[i] - num[pre]); ++k) {
					Inc(f[i][j], 1ll * f[pre][j - k] * g(pre + 1, i - 1, k, v[pre].second, v[i].second, v[pre].first, v[i].first) % p * C(num[i], num[pre]) % p);
				}
				// printf("%d %d %d\n", i, j, f[i][j]);
			}
			pre = i;
		}
	}
	int ans = 0;
	for(int j = 0; j <= m; ++j) {
		if(cnt[0] + j > cnt[1] + m - j) {
			// printf("%d\n", j);
			Inc(ans, f[(int)v.size() - 1][j]);
		}
	}
	printf("%d", ans);
	return 0;
}