#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1007, mod = 1e9 + 7;
ll grid[N][N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m, k; cin >> n >> m >> k;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
grid[i][j] = j + (i - 1) * m;
}
}
while (k--) {
char type; cin >> type;
if (type == 'R') {
int x, y; cin >> x >> y;
for (int i = 1; i <= m; i++) {
grid[x][i] = (grid[x][i] * y) % mod;
}
}
else {
int x, y; cin >> x >> y;
for (int i = 1; i <= n; i++) {
grid[i][x] = (grid[i][x] * y) % mod;
}
}
}
ll ans = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
ans = (ans + grid[i][j]) % mod;
}
}
cout << ans << '\n';
}
