#pragma GCC optimize("Ofast")
//#pragma GCC target ("sse4")

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 2;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}


char mp[5000][5000];
modint dp[5000][5000];
void solve() {
	int h, w; cin >> h >> w;
	int n; cin >> n;
	rep(i, h)rep(j, w)mp[i][j] = '?';
	rep(i, n) {
		int x, y; char c; cin >> x >> y >> c; x--; y--;
		mp[x][y] = c;
	}
	dp[0][0] = 1;
	modint c = (modint)2 / (modint)3;
	rep(i, h)rep(j, w) {
		char t = mp[i][j];
		if (i + 1 < h) {
			if (t == 'D' || t == 'X')dp[i + 1][j] += dp[i][j];
			else if (t == '?')dp[i + 1][j] += (modint)c * dp[i][j];
		}
		if (j + 1 < w) {
			if (t == 'R' || t == 'X')dp[i][j + 1] += dp[i][j];
			else if (t == '?')dp[i][j + 1] += (modint)c * dp[i][j];
		}
	}
	modint pro = 1;
	rep(i, h)rep(j, w)if (mp[i][j] == '?')pro *= 3;
	cout << pro*dp[h - 1][w - 1] << "\n";
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(15);
	//init_f();
	//init();
	//expr();
	//int t; cin >> t; rep(i,t)
	solve();
	return 0;
}
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
using ll = long long;
using P = pair<ll, ll>;

int main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    
    ll k; cin >> k;
    vector<ll> a(5, 0), b(5, 0);
    vector<ll> x(10, k);
    string s, t; cin >> s >> t;
    rep(i, s.size()) {
        if (s[i] == '#') continue; 
        a[i] = s[i] - '0';
    }
    rep(i, t.size()) {
        if (t[i] == '#') continue; 
        b[i] = t[i] - '0';
    }
    rep(i, 5) {
        x[a[i]]--, x[b[i]]--;
    }

    // rep(i, 5) {
    //     cout << a[i] << " ";
    // }
    // cout << endl;
    // rep(i, 5) {
    //     cout << b[i] << " ";
    // }
    // cout << endl;
    // rep(i, 10) cout << x[i] << " ";
    // cout << endl;

    double ans = 0;
    auto calc = [&]() {
        vector<ll> cnt1(10), cnt2(10);
        rep(i, a.size()) cnt1[a[i]]++;
        rep(i, b.size()) cnt2[b[i]]++;
        ll score1 = 0, score2 = 0;
        for (ll i = 1; i < 10; i++) {
            ll res = 1;
            rep(j, cnt1[i]) res *= 10;
            score1 += res * i;
        }
        for (ll i = 1; i < 10; i++) {
            ll res = 1;
            rep(j, cnt2[i]) res *= 10;
            score2 += res * i;
        }
        double res = 0;
        if (score1 > score2) {
            if (a[4] == b[4]) {
                res = double(x[a[4]] * (x[a[4]] - 1)) / (double(9 * k - 8) * double(9 * k - 9));
            }
            else {
                res = double(x[a[4]] * x[b[4]]) / (double(9 * k - 8) * double(9 * k - 9));
            }
        }
        return res;
    };
    rep(i, 9) {
        rep(j, 9) {
            a[4] = i + 1, b[4] = j + 1;
            ans += calc();
            // cout << fixed << setprecision(15) << calc() << endl;
        }
    }
    cout << fixed << setprecision(15) << ans << endl;
    return 0;
}
