#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <fstream>
#include <queue>
using namespace std;
#define MOD 1000000007
#define MAXN 1000005
int main() {
long long n, m, k;
cin >> n >> m >> k;
long long rows[MAXN], cols[MAXN];
for (int i = 0; i < MAXN; i++) {
rows[i] = 1;
cols[i] = 1;
}
for (int i = 0; i < k; i++) {
char c;
long long a, b;
cin >> c >> a >> b;
if (c == 'R') {
rows[a] = (rows[a]*b + MOD)%MOD;
}
else {
cols[a] = (cols[a] * b + MOD) % MOD;
}
}
long long num1 = 0, num2 = 0;
for (int i = 1; i <= m; i++) {
num1 = (num1 + cols[i]) % MOD;
num2 = (num2 + i * cols[i]) % MOD;
}
long long ans = 0;
for (int i = 1; i <= n; i++) {
ans = (ans + rows[i]*(num2 + (i - 1)*m*num1)) % MOD;
}
cout << ans << endl;
}
