#include<bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include"debug.h"
#else
#define debug(...) void()
#endif
#define all(x) (x).begin(),(x).end()
template<class T>
auto ary(T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
using ll=long long;
using ull=unsigned ll;
const int N=2e5+10,M=N*2,mod=998244353;
const ll INF=1e18;
int k,n,m,a[M],cnt[M],pre[M];
ll sum[M],f[M];
int g[M];
void chkmin(ll &x,ll y,int &tx,int ty){
	if(x>y)x=y,tx=ty;
	else if(x==y)(tx+=ty)%=mod;
}
pair<ll,int> solve(int d){
	memset(f,0x3f,sizeof f);
	memset(g,0,sizeof g);
	int st=0,ed=n;
	for(;st<=n&&cnt[st]!=d;st++);
	for(;ed>=0&&cnt[ed]!=cnt[n]+d;ed--);
	if(st>ed)return {INF,0};
	f[st]=0,g[st]=1;
	for(int i=st+1;i<=ed;i++){
		if(a[i]>0)chkmin(f[i],f[i-1],g[i],g[i-1]);
		if(pre[i]>=st)chkmin(f[i],f[pre[i]]+abs(sum[i]-sum[pre[i]]),g[i],g[pre[i]]);
	}
	return {f[ed]+abs(sum[st]+sum[n]-sum[ed]+1ll*k*d),g[ed]};
}
int main(){
	scanf("%d%d%d",&k,&n,&m),n+=m;
	for(int i=1,x;i<=n;i++){
		static char str[9];
		scanf("%d%s",&x,str);
		a[i]=*str=='H'?1:-1;
		cnt[i]=cnt[i-1]+a[i];
		sum[i]=sum[i-1]+a[i]*x;
	}
	static int cur[M];
	memset(cur,-1,sizeof cur);
	for(int i=0;i<=n;i++){
		pre[i]=cur[cnt[i]+m],cur[cnt[i]+m]=i;
	}
	int l=n,r=-n,mid;
	for(int i=0;i<=n;i++){
		l=min(l,cnt[i]),r=max(r,cnt[i]);
	}
	r-=cnt[n];
	for(;l+1<r;){
		mid=(l+r)>>1;
		if(solve(mid)<solve(mid+1))r=mid;
		else l=mid+1;
	}
	ll ans=min(solve(l),solve(r)).first;
	int res=0;
	for(int i=r;;i++){
		auto [x,y]=solve(i);
		if(x==ans)(res+=y)%=mod;
		else break;
	}
	for(int i=l;;i--){
		auto [x,y]=solve(i);
		if(x==ans)(res+=y)%=mod;
		else break;
	}
	cout<<ans<<endl<<res<<endl;
	return 0;
}
#ifdef DEBUG
#include"debug.hpp"
#endif