#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>

#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>

using namespace std;

typedef long long LL;
typedef vector<int> VI;

#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(),i##_end=(c).end();i!=i##_end;++i)

template<class T> inline void amin(T &x, const T &y) { if (y<x) x=y; }
template<class T> inline void amax(T &x, const T &y) { if (x<y) x=y; }
#define rprintf(fmt, begin, end) do { const auto end_rp = (end); auto it_rp = (begin); for (bool sp_rp=0; it_rp!=end_rp; ++it_rp) { if (sp_rp) putchar(' '); else sp_rp = true; printf(fmt, *it_rp); } putchar('\n'); } while(0)


template<unsigned MOD_> struct ModInt {
    static constexpr unsigned MOD = MOD_;
    unsigned x;
    void undef() { x = (unsigned)-1; }
    bool isnan() const { return x == (unsigned)-1; }
    inline int geti() const { return (int)x; }
    ModInt() { x = 0; }
    ModInt(int y) { if (y<0 || (int)MOD<=y) y %= (int)MOD; if (y<0) y += MOD; x=y; }
    ModInt(unsigned y) { if (MOD<=y) x = y % MOD; else x = y; }
    ModInt(long long y) { if (y<0 || MOD<=y) y %= MOD; if (y<0) y += MOD; x=y; }
    ModInt(unsigned long long y) { if (MOD<=y) x = y % MOD; else x = y; }
    ModInt &operator+=(const ModInt y) { if ((x += y.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(const ModInt y) { if ((x -= y.x) & (1u<<31)) x += MOD; return *this; }
    ModInt &operator*=(const ModInt y) { x = (unsigned long long)x * y.x % MOD; return *this; }
    ModInt &operator/=(const ModInt y) { x = (unsigned long long)x * y.inv().x % MOD; return *this; }
    ModInt operator-() const { return (x ? MOD-x: 0); }

    ModInt inv() const { return pow(MOD-2); }
    ModInt pow(long long y) const {
	ModInt b = *this, r = 1;
	if (y < 0) { b = b.inv(); y = -y; }
	for (; y; y>>=1) {
	    if (y&1) r *= b;
	    b *= b;
	}
	return r;
    }

    friend ModInt operator+(ModInt x, const ModInt y) { return x += y; }
    friend ModInt operator-(ModInt x, const ModInt y) { return x -= y; }
    friend ModInt operator*(ModInt x, const ModInt y) { return x *= y; }
    friend ModInt operator/(ModInt x, const ModInt y) { return x *= y.inv(); }
    friend bool operator<(const ModInt x, const ModInt y) { return x.x < y.x; }
    friend bool operator==(const ModInt x, const ModInt y) { return x.x == y.x; }
    friend bool operator!=(const ModInt x, const ModInt y) { return x.x != y.x; }
};

constexpr LL MOD = 1000000007;
// constexpr LL MOD = 998244353;
using Mint = ModInt<MOD>;

const int MAX = 3000011;
Mint inv[MAX], fact[MAX], fact_inv[MAX];

bool _auto_init() {
    fact[0] = 1;
    for (int i=1; i<MAX; i++) fact[i] = fact[i-1] * i;
    fact_inv[MAX-1] = fact[MAX-1].inv();
    for (int i=MAX-2; i>=0; i--) fact_inv[i] = fact_inv[i+1] * (i+1);
    inv[0] = 0;
    for (int i=1; i<MAX; i++) inv[i] = fact_inv[i] * fact[i-1];
    return true;
}
const bool _auto_init_done = _auto_init();

Mint nCk(int n, int k) {
    return fact[n] * fact_inv[k] * fact_inv[n-k];
}

int N, M, K;
void MAIN() {
    scanf("%d%d%d", &N, &M, &K);

    Mint ans;
    if (N - M > K) {
	ans = 0;
    } else {
	ans = nCk(N+M, N);
	int X = K+1;
	if (X <= N) {
	    ans -= nCk(N+M, N-X);
	}
    }

    printf("%d\n", ans.geti());
}

int main() {
    int TC = 1;
//    scanf("%d", &TC);
    REP (tc, TC) MAIN();
    return 0;
}


#include <bits/stdc++.h>
#define st first
#define nd second
#define PQ priority_queue

using ll = long long ;
using namespace std;
using pii = pair<int,int>;
const int N = 5e3 + 10;
const int MOD = 998244353;
int dp[N][N], val[N][N], row[N], col[N];
int mul(int x, int y){ return 1LL * x * y % MOD;}
int add(int x, int y){ return (1LL * x + y) % MOD;}
int main(){
	int h, w, k;
	scanf("%d %d %d", &h, &w, &k);
	for(int i = 1; i <= h; i++) row[i] = 1;
	for(int j = 1; j <= w; j++) col[j] = 1;
	for(int i = 1; i <= k; i++){
		char s[3];
		int x, y;
		scanf("%d%d%s", &x, &y, s);
		if(s[0] == 'R') dp[x][y] = 1;
		if(s[0] == 'D') dp[x][y] = 2;
		if(s[0] == 'X') dp[x][y] = 3;
	}
	val[1][1] = 1;
	for(int i = 1; i <= h; i++){
		for(int j = 1;j <= w; j++){
			if(i == 1 & j == 1) continue;
			if(dp[i - 1][j] == 0) val[i][j] = add(val[i][j], mul(row[i], mul(2, val[i - 1][j])));
			else if(dp[i- 1][j] != 1) val[i][j] = add(val[i][j], mul(row[i], val[i - 1][j]));
			if(dp[i][j - 1] == 0) val[i][j] = add(val[i][j],  mul(col[j], mul(2 , val[i][j - 1])));
			else if(dp[i][j - 1] != 2) val[i][j] = add(val[i][j], mul(col[j], val[i][j - 1]));
			if(dp[i][j] == 0) {
				col[j] = mul(col[j], 3);
				row[i] = mul(row[i], 3);
			}   
		}

	}
	if(dp[h][w] == 0) val[h][w] = mul(val[h][w], 3);
	printf("%d", val[h][w]);


}