#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}


ll jyo(ll x,ll y,ll z){
  ll H=y; //ここから
       ll a=1,b=x%z,c=1;
       while(H>0){
         a*=2;
         if(H%a!=0){
           H-=a/2;
           c*=b;
           c%=z;
         }
        b*=b;
         b%=z;
      } //ここまで
 return c;
}

void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	ll N,X;
	cin>>N>>X;
	vector<ll> C(2);
	vector<pair<ll,ll>> p;
	int L=-1;
	rep(i,X){
		char c;
		ll a;
		int b=0;
		cin>>c>>a;
		if(c=='R') b=1;
		if(p.size()==0||p[L].first!=b){
			p.push_back({b,a});
			L++;
		}else p[L].second+=a;
		C[b]+=a;
	}
	ll ans=0;
	rep(i,2){
		ll tmp=(C[i]-1)*(C[i]-3);
		tmp=jyo(((tmp%mod)*24ll)%mod,mod-2,mod);
		rep(k,4){
			tmp=(tmp*(C[i]-k))%mod;
		}
		ans+=tmp;
	}
	//cout<<(15ll*ans)%mod<<"\n";
	L++;
	vector<ll> dp(10);
	dp[0]=1,dp[1]=1;
	rep(i,L){
		for(int j=7-p[i].first;j>=0;j-=2){
			dp[(j^1)+2]+=(dp[j]*p[i].second)%mod;
			dp[(j^1)+2]%=mod;
		}
	}
	ans+=(((dp[8]+dp[9])%mod)*jyo((C[0]-1)*(C[1]-1),mod-2,mod))%mod;
	cout<<(ans%mod+mod)%mod<<"\n";
}