//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
const ll mod=998244353;
ll x;
int n,m;
ll pos[400400];
char type[400400];
bool used[400400];
ll dp[400400],cnt[400400];
int psum[400400];
int nxt[400400];
int ppos[800800];
ll psum2[400400];
inline ll red(ll x){return x>=mod?x-mod:x;}
ll calc(ll k,bool tp)
{
	for(int i=1;i<=n+m;i++)
		used[i]=0;
	ll sum=0;
	int tmp1=max(k,0ll),tmp2=max(-k,0ll);
	for(int i=1;i<=n+m;i++)
	{
		if(tmp1&&type[i]=='P')
		{
			tmp1--;
			sum+=pos[i];
			used[i]=1;
		}
		if(tmp2&&type[i]=='H')
		{
			tmp2--;
			sum+=pos[i];
			used[i]=1;
		}
	}
	tmp1=max(k,0ll);
	tmp2=max(-k,0ll);
	for(int i=n+m;i>=1;i--)
	{
		if(tmp1&&type[i]=='H')
		{
			tmp1--;
			sum+=x-pos[i];
			used[i]=1;
		}
		if(tmp2&&type[i]=='P')
		{
			tmp2--;
			sum+=x-pos[i];
			used[i]=1;
		}
	}
	vector<int> vec;
	for(int i=1;i<=n+m;i++)
		if(!used[i])
			vec.pb(i);
	memset(dp,0x3f,sizeof(dp));
	memset(cnt,0,sizeof(cnt));
	memset(nxt,-1,sizeof(nxt));
	memset(ppos,-1,sizeof(ppos));
	dp[0]=0;
	cnt[0]=1;
	for(int i=0;i<sz(vec);i++)
		psum[i+1]=psum[i]+(type[vec[i]]=='P'?1:-1);
	for(int i=0;i<sz(vec);i++)
		psum2[i+1]=psum2[i]+(type[vec[i]]=='P'?pos[vec[i]]:-pos[vec[i]]);
	for(int i=sz(vec);i>=0;i--)
	{
		nxt[i]=ppos[psum[i]+400000];
		ppos[psum[i]+400000]=i;
	}
	for(int i=0;i<sz(vec);i++)
	{
		if(type[vec[i]]=='H')
		{
			if(dp[i]<dp[i+1])
			{
				dp[i+1]=dp[i];
				cnt[i+1]=0;
			}
			if(dp[i]==dp[i+1])
				cnt[i+1]=red(cnt[i]+cnt[i+1]);
		}
		if(nxt[i]!=-1)
		{
			if(dp[i]+abs(psum2[nxt[i]]-psum2[i])<dp[nxt[i]])
			{
				dp[nxt[i]]=dp[i]+abs(psum2[nxt[i]]-psum2[i]);
				cnt[nxt[i]]=0;
			}
			if(dp[i]+abs(psum2[nxt[i]]-psum2[i])==dp[nxt[i]])
				cnt[nxt[i]]=red(cnt[i]+cnt[nxt[i]]);
		}
	}
	if(!tp) return dp[sz(vec)]+sum;
	return cnt[sz(vec)];
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>x>>n>>m;
	for(int i=1;i<=n+m;i++)
		cin>>pos[i]>>type[i];
	ll L=-n,R=n;
	while(L<R)
	{
		ll Lmid=(L+L+R+1+3e6)/3-1e6,Rmid=(L+R+R+2+3e6)/3-1e6;
		ll Lval=calc(Lmid,0),Rval=calc(Rmid,0);
		if(Lval>=Rval)
			L=Lmid+1;
		else
			R=Rmid-1;
	}
	ll ans=0;
	ll Val=calc(L,0);
	for(int i=-2;i<=2;i++)
		if(calc(i+L,0)==Val)
			ans=(ans+calc(i+L,1))%mod;
	cout<<Val<<endl<<ans<<endl;
	return 0;
}