#include<bits/stdc++.h>
#define rep(i, a, b) for(long long i=(a) ; i<=(b) ; ++i)
#define Task ""
using namespace std;
const int N=1000005;
const int mod=1000000007;
long long col[N], row[N], m, n, k;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//freopen(Task".inp", "r", stdin);
//freopen(Task".out", "w", stdout);
cin >> m >> n >> k;
rep(i, 1, m) row[i]=1;
rep(i, 1, n) col[i]=1;
rep(i, 1, k) {
char c;
long long x, y;
cin >> c >> x >> y;
if(c=='R') (row[x]*=y)%=mod;
else (col[x]*=y)%=mod;
}
long long val1=0, val2=0;
rep(i, 1, n) {
val1=(val1+1ll*col[i]*i)%mod;
val2=(val2+1ll*col[i]*n)%mod;
}
long long ans=0;
rep(i, 1, m) {
long long xx=(1ll*(i-1)*val2)%mod;
ans=(((0ll+val1+xx) % mod)*row[i]+ans)%mod;
}
cout << ans;
return 0;
}
