#include<bits/stdc++.h>
using namespace std;


#define rep(i,a,b) for(ll i=a,i##end=b;i<=i##end;++i)
#define drep(i,a,b) for(ll i=a,i##end=b;i>=i##end;--i)

#define erep(i,a) for(ll i=hd[a],y;(y=to[i]);i=nxt[i])
#define Mod(x) (x>=P)&&(x-=P)
typedef long long ll;
char IO;
ll rd(ll res=0){
	bool f=0;
	while(IO=getchar(),IO<48||IO>57)
		f|=IO=='-';
	do res=(res<<1)+(res<<3)+(IO^48);
	while(isdigit(IO=getchar()));
	return f?-res:res;
}
void Max(ll &x,ll y){x<y&&(x=y);}
const ll M=155,P=998244353;
ll n,dp[M][M][M*2][2],C[M][M],ans[M*2][2],m;

struct node{
	ll x,c;
	bool operator <(const node &_)const{
		return x<_.x;
	}
}p[M];
ll dfs(ll l,ll r,ll cl,ll dis){
	if(l==r-1){
		//cout<<l<<" "<<r<<" "<<cl<<" "<<dis<<endl;
		return dis==0;
	}
	if(~dp[l][r][dis+n][cl])return dp[l][r][dis+n][cl];
	ll res=0;
	rep(k,l+1,r-1){
		if(p[k].x-p[l].x<=p[r].x-p[k].x){
			if(cl)res+=dfs(k,r,cl,dis-(k-l))*C[r-l-2][r-k-1]%P,Mod(res);
			else res+=dfs(k,r,cl,dis+(k-l))*C[r-l-2][r-k-1]%P,Mod(res);
		}else{
			if(!cl)res+=dfs(l,k,cl,dis-(r-k))*C[r-l-2][r-k-1]%P,Mod(res);
			else res+=dfs(l,k,cl,dis+(r-k))*C[r-l-2][r-k-1]%P,Mod(res);
		}
	}
	//cout<<l<<" "<<r<<" "<<dis<<" "<<cl<<" "<<res<<endl;
	return dp[l][r][dis+n][cl]=res;
}
char s[10];
int main(){
	memset(dp,-1,sizeof dp);
	n=rd(),m=rd();
	rep(i,1,n){
		p[i].x=rd();
		scanf("%s",s);
		if(*s=='B')p[i].c=2;
		else p[i].c=1;
	}
	rep(i,1,m)p[i+n].x=rd();
	n+=m;
	sort(p+1,p+n+1);
	rep(i,0,n)rep(j,C[i][0]=1,i)
		C[i][j]=C[i-1][j]+C[i-1][j-1],Mod(C[i][j]);
	ll L,R;
	rep(i,1,n)if(p[i].c)R=i;
	drep(i,n,1)if(p[i].c)L=i;

	ll t=0,cnt=0;
	if(p[L].c==1)t+=L-1;
	else t-=L-1;
	if(p[R].c==1)t+=n-R;
	else t-=n-R;
	cnt=L-1+n-R;
	rep(i,1,n)t+=(p[i].c==1)-(p[i].c==2);
	ans[t+n][0]=C[L-1+n-R][L-1];
	ll tl=L;

	rep(i,L+1,n){
		if(p[i].c){
			cnt+=i-tl-1;
			if(p[i].c==p[tl].c){
				if(p[i].c==2){
					rep(j,-n,n)if(j-(i-tl-1)+n>=0)
						ans[j-(i-tl-1)+n][1]+=ans[j+n][0]*C[cnt][i-tl-1]%P,Mod(ans[j-(i-tl-1)+n][1]);
				}else{
					rep(j,-n,n)
						ans[j+(i-tl-1)+n][1]+=ans[j+n][0]*C[cnt][i-tl-1]%P,Mod(ans[j+(i-tl-1)+n][1]);
				}
			}else{
				rep(j,-n,n)rep(k,-n,n)if(j+k+n>=0)
					ans[j+k+n][1]+=ans[j+n][0]*dfs(tl,i,2-p[tl].c,k)%P*C[cnt][i-tl-1]%P,Mod(ans[j+k+n][1]);
			}
			tl=i;
			rep(j,-n,n)ans[j+n][0]=ans[j+n][1],ans[j+n][1]=0;
		}
	}
	ll res=0;
	rep(i,1,n)res+=ans[i+n][0],Mod(res);
	printf("%lld",res);
	return 0;
}