#include<bits/stdc++.h>
using namespace std;
int n , m;
typedef long long ll;
vector<pair<int,int> > v;
typedef vector<int> poly;
const int mod = 998244353;
int c[105][105];
int t[105];
poly operator* (poly a,poly b)
{
    poly C(a.size() + b.size() - 1);
    for(int i = 0;i < a.size();i++) {
        for(int j = 0;j < b.size();j++) {
            C[i + j] = (C[i + j] + 1LL*a[i]*b[j]) % mod;
        }
    }
    return C;
}
poly operator+ (poly a,poly b)
{
    if(a.size() < b.size()) a.resize(b.size());
    for(int i = 0;i < a.size() && i < b.size();i++) a[i] = (a[i] + b[i]) % mod;
    return a;
}
inline int C(int a,int b)
{
    return c[a][b];
}
poly solve(int l,int r)
{
   // printf("sol %d %d\n",l,r);
    if(r - l + 1 <= 2) {
        poly p(1) ; p[0] = 1;
        return p;
    }
    poly dp[55][55][2];
    int len = r - l + 1;
    for(int i = len;i >= 1;i--) {
        for(int j = i;j <= len;j++) {
            for(int u = 0;u < 2;u++){
            if(i == j || i + 1 == j) {
                dp[i][j][u].resize(1) ; dp[i][j][u][0] = 1;
            }
            else {
                for(int k = i + 1;k < j;k++) {
                    poly L , R;
                    if(v[k+l-1].first - v[i+l-1].first <= v[j+l-1].first - v[k+l-1].first) {
                        L.resize(k - i) ;
                        if(u == 0) L[k - i - 1] = t[k - i - 1];
                        else L[0] = t[k - i - 1];
                        auto w = L * dp[k][j][u];
                        for(auto &x : w) x = 1LL*x*C(j - i - 2 , k - i - 1) % mod;
                        w.resize(w.size() + 1);
                        if(u == 0) {
                            for(int i = w.size() - 1;i >= 1;i--) w[i] = w[i - 1];
                            w[0] = 0;
                        }
                        /*if(i == 1 && j == 5) {
                            printf("K %d , %d ",k , t[k - i - 1]);
                            for(auto x : w) printf("%d ",x);
                            printf("\n");
                        }*/
                        dp[i][j][u] = dp[i][j][u] + w;
                    }
                    else {
                        R.resize(j - k);
                        if(u == 1) R[j - k - 1] = t[j - k - 1];
                        else R[0] = t[j - k - 1];
                        auto w = dp[i][k ][u] * R;
                        for(auto &x : w) x = 1LL*x*C(j - i - 2 , k - i - 1) % mod;
                        w.resize(w.size() + 1);
                        if(u == 1) {
                            for(int i = w.size() - 1;i >= 1;i--) w[i] = w[i - 1];
                            w[0] = 0;
                        }
                       /* if(i == 1 && j == 5) {
                            printf("K %d , ",k);
                            for(auto x : w) printf("%d ",x);
                            printf("\n");
                        }*/
                        dp[i][j][u] = dp[i][j][u] + w;
                    }
                }
            }
           /* printf("%d %d %d : ",i,j,u);
            for(auto x : dp[i][j][u]) printf("%d ",x);
            printf("\n");*/
            }
        }
    }
    return dp[1][len][v[l].second];
}
int main()
{
   // freopen("in.txt","r",stdin);
    ios::sync_with_stdio(false) ; cin.tie(0) ; cout.tie(0);
    cin >> n >> m;
    for(int i = 1;i <= n;i++) {
        int x;
        string s;cin >>x >> s;
        if(s == "RED") v.push_back(pair<int,int>{x , 0});
        else v.push_back(pair<int,int>{x , 1});
    }
    c[0][0] = 1; t[0] = 1;
    for(int i = 1;i <= n + m;i++) {
        c[i][0] = 1; t[i]  = 1LL*t[i - 1]*i % mod;
        for(int j = 1;j <= i;j++) c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
    }
    for(int i = 1;i <= m;i++) {
        int x;cin >> x;v.push_back(pair<int,int>{x , -1});
    }
    sort(v.begin() , v.end());
    int lst =-1;
    poly ans(1) ; ans[0] = 1;
    int d = (n + m + 1) / 2;
    for(int i = 0;i <= v.size();i++) {
        if(i == v.size() || v[i].second != -1) {
            if(v[i].second == 0) d--;
            if(lst == -1 || i == v.size()) {
                int num = i - lst - 1;
                poly p(num + 1) ;
                int u = (i == v.size() ? v[lst].second : v[i].second);
                if(u == 0) p[num] = t[num];
                else p[0] = t[num];
                lst = i;
                int x = ans.size() - 1 , y = p.size() - 1;
              //  printf("C %d , %d %d\n",c[x + y][x],x,y);
                ans = ans * p;
                for(auto &i : ans) i = 1LL*i*c[x+y][x] % mod;
            }
            else {
                int num = i - lst - 1;
                poly p;
                if(v[i].second == v[lst].second){
                    p.resize(num + 1) ;
                    if(v[i].second == 0) p[num] = t[num];
                    else p[0] = t[num];
                }
                else {
                    p = solve(lst , i );
                }
                int x = ans.size() - 1 , y = p.size() - 1;
              //  printf("C %d , %d %d\n",c[x + y][x],x,y);
                ans = ans * p;
                for(auto &i : ans) i = 1LL*i*c[x+y][x] % mod;
                lst = i;
            }
        }
    }
    int sol = 0;
   // cout << d << '\n';
    for(int i = max(0,d);i < ans.size();i++) sol = (sol + ans[i]) % mod;
    cout << sol ;
    return 0;
}