#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<ll,ll> pii;

const int maxn=100;
const ll INF=1e18;
const ll mod=998244353;

ll fac[maxn+50];
ll ifac[maxn+50];
ll ksm(ll a,ll x){
	ll ret=1;
	for (;x;x>>=1,a=a*a%mod) if (x&1) ret=ret*a%mod;
	return ret;	
}
void prepare(){
	fac[0]=1;
	for (int i=1;i<=maxn;i++) fac[i]=fac[i-1]*i % mod;
	ifac[maxn]=ksm(fac[maxn],mod-2);
	for (int i=maxn-1;i>=0;i--) ifac[i]=ifac[i+1]*(i+1)%mod;
}
inline ll C(ll n,ll m){
	if (m<0 || m>n) return 0;
	return fac[n]*ifac[m] % mod*ifac[n-m]%mod;
}
inline ll A(ll n,ll m){
	if (m<0 || m>n) return 0;
	return fac[n]*ifac[n-m]%mod;	
}

int n,m;
pii a[maxn+50];
ll b[maxn+50];

const int lim=80;
inline ll& ref(vector<ll> &v,int x){
	return v[x+lim];
}

vector<ll> rec[maxn+50][maxn+50];
bool vis[maxn+50][maxn+50];
vector<ll> solve(ll l,ll r,ll xl,ll xr,ll tp){
	if (l>r){
		vector<ll> ans(2*lim+1);
		ref(ans,0)=1;
		return ans;	
	}
	if (vis[l][r]) return rec[l][r];
	vector<ll> ans(2*lim+1);
	
	for (int k=l;k<=r;k++){
		if (xr-b[k]<b[k]-xl){
			vector<ll> tmp=solve(l,k-1,xl,b[k],tp);
			ll prod=A(r-l,r-k);
			for (int i=-lim;i<=lim;i++){
				int j=i+(r-k+1)*(-tp);
				if (-lim<=j && j<=lim){
					(ref(ans,j)+=prod*ref(tmp,i))%=mod;
				}
			}
		}
		else{
			vector<ll> tmp=solve(k+1,r,b[k],xr,tp);
			ll prod=A(r-l,k-l);
			for (int i=-lim;i<=lim;i++){
				int j=i+(k-l+1)*(tp);
				if (-lim<=j && j<=lim){
					(ref(ans,j)+=prod*ref(tmp,i))%=mod;
				}
			}
		}
	}
	vis[l][r]=1;
	rec[l][r]=ans;
	/*
	cout << l << " " << r << " " << xl << " " << xr << endl;
	for (int i=-3;i<=3;i++) cout << ref(ans,i) << " ";
	cout << endl;
	*/
	return ans;
}

signed main(){
	prepare();
	cin >> n >> m;
	for (int i=1;i<=n;i++){
		cin >> a[i].first;
		string str;
		cin >> str;
		if (str[0]=='R') a[i].second=1;	
	}
	for (int i=1;i<=m;i++) cin >> b[i];
	sort(a+1,a+n+1);
	sort(b+1,b+m+1);
	a[0]=make_pair(-INF,a[1].second);
	a[n+1]=make_pair(INF,a[n].second);
	/*
	for (int i=0;i<=10;i++) cout << a[i].first << " ";cout << endl;
	for (int i=0;i<=10;i++) cout << a[i].second << " ";cout << endl;
	for (int i=0;i<=10;i++) cout << b[i] << " ";cout << endl;
	*/
	vector<ll> dp(2*lim+1);
	ref(dp,0)=1;
	
	for (int i=1,l=1;i<=n+1;i++){
		if (l>m) break;
		if (a[i-1].first<=b[l] && b[l]<=a[i].first){
			int r=l;
			for (;r<=m && (a[i-1].first<=b[r] && b[r]<=a[i].first);) r++;
			r--;
			if (a[i-1].second==a[i].second){
				ll prod=A(r,r-l+1)%mod;
				for (auto &e:dp) e=e*prod % mod;
			}
			else{
				vector<ll> now=solve(l,r,a[i-1].first,a[i].first,a[i-1].second-a[i].second);
				vector<ll> tmp(2*lim+1);
				for (int x=-lim;x<=lim;x++){
					for (int y=-lim;y<=lim;y++){
						if (-lim<=x+y && x+y<=lim){
							(ref(tmp,x+y)+=ref(dp,x)*ref(now,y))%=mod;
						}
					}
				}
				dp.swap(tmp);
				for (auto &e:dp) e=e*C(r,r-l+1)%mod;
			}
			/*
			cout << "i : " << i << "\n";
			cout << "l,r : " << l << " " << r << "\n";
			*/
			l=r+1;
		}
		else continue;
	}
	ll cnt=0;
	for (int i=1;i<=n;i++) if (a[i].second) cnt++;else cnt--;
	ll ans=0;
	for (int i=-lim;i<=lim;i++){
		if (cnt+i>0){
			ans=(ans+ref(dp,i))%mod;
		}
	}
	cout << ans << "\n";
	return 0;	
}