#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 998244353
#define pii pair<int,int>
#define inf 1000000000000000000LL

pii h[800010];

int st[800010],top;

ll sum1[400010],sum2[400010];
int l[400010],r[400010],t,n,m;
bool bo[400010];
char s[110];

inline int rd()
{
	int x=0;char ch=getchar();
	for (;ch<'0'||ch>'9';ch=getchar());
	for (;ch>='0'&&ch<='9';ch=getchar()) x=x*10+ch-'0';
	return x;
}

inline int pls(const int &x,const int &y) { return (x+y<mod)?x+y:x+y-mod; }
inline int mns(const int &x,const int &y) { return (x-y<0)?x-y+mod:x-y; }
inline int ksm(int x,int y) { int res=1;for (;y;y>>=1,x=(ll)x*x%mod) if (y&1) res=(ll)res*x%mod;return res; }

inline int calc(int x,int y)
{
	int ans1=abs(h[x].first-h[y].first),ans2=t-ans1;
	return min(ans1,ans2);
}

int main()
{
	t=rd();n=rd();m=rd();
	for (int i=1;i<=n+m;i++)
	{
		int x=rd();scanf("%s",s+1);
		if (s[1]=='P') h[i]=pii(x,0);
		else h[i]=pii(x,1);
	}
	for (int i=1;i<=n+m;i++) h[n+m+i]=h[i];
	top=0;
	for (int i=1;i<=(n+m)*2;i++)
	{
		if (h[i].second==1) st[++top]=i;
		else
		{
			if (i>(n+m))
			{
				int x=(st[top]-1)%(n+m)+1;
				l[i-n-m]=x;r[x]=i-n-m;
			}
			if (top) top--;
		}
	}
	top=0;
	for (int i=(n+m)*2;i;i--)
	{
		if (h[i].second==1) st[++top]=i;
		else
		{
			if (i<=(n+m))
			{
				int x=(st[top]-1)%(n+m)+1;
				r[i]=x;l[x]=i;
			}
			if (top) top--;
		}
	}
	ll ans1=0;
	int ans2=1;
	for (int j=1;j<=n+m;j++) if (h[j].second==0&&!bo[j])
	{
		int hh=j;
		while (l[hh]&&l[hh]!=j) hh=l[hh];
		st[top=1]=hh;bo[hh]=true;
		for (int now=st[top];r[now]&&!bo[r[now]];now=st[top]) st[++top]=r[now],bo[st[top]]=true;
		if (top&1)
		{
			sum1[0]=sum2[top+1]=0;
			for (int i=2;i<top;i+=2) sum1[i]=sum1[i-2]+calc(st[i-1],st[i]);
			for (int i=top-1;i;i-=2) sum2[i]=sum2[i+2]+calc(st[i+1],st[i]);
			ll res=inf;int cnt=0;
			for (int i=0;i<=top-1;i+=2)
			{
				if (sum1[i]+sum2[i+2]<res) res=sum1[i]+sum2[i+2],cnt=1;
				else if (sum1[i]+sum2[i+2]==res) cnt++;
			}
			ans1+=res;ans2=(ll)ans2*cnt%mod;
		}
		else
		{
			st[top+1]=st[1];
			ll s1=0,s2=0;
			for (int i=1;i<top;i+=2) s1+=calc(st[i],st[i+1]);
			for (int i=2;i<=top;i+=2) s2+=calc(st[i],st[i+1]);
			ans1+=min(s1,s2);
		}
	}
	printf("%lld\n%d\n",ans1,ans2);
	return 0;
}