#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")
#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 1000001
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9
using namespace std;
//using namespace __gnu_pbds;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef short int si;
typedef array <int, 2> a2;
//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
ll row[N], cow[N];
int main()
{
//freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);
ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, m, k;
cin >> n >> m >> k;
for (int i = 0; i < n; i++) row[i] = 1;
for (int i = 0; i < m; i++) cow[i] = 1;
for (int i = 0; i < k; i++)
{
char c;
cin >> c;
ll x, val;
cin >> x >> val;
x--;
if (c == 'R') row[x] = (row[x] * val) % M;
else cow[x] = (cow[x] * val) % M;
}
ll ans = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
{
ll val = i * m + j + 1;
val = (val * cow[j]) % M;
val = (val * row[i]) % M;
ans += val;
}
cout << ans << endl;
}
