#include <bits/stdc++.h>
using namespace std;
#define int long long 
const int inf = 1e12;
#define D long double
#define NeedForSpeed ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int MOD = 1000000007;
#define fi first
#define se second
#define endl '\n'
// random_device rd;
// mt19937 rng(rd());
// int getRand(int l,int r){ // get random number in the range [l,r]
//   uniform_int_distribution<int> uid(l,r);
//   return uid(rng);
// }
const int N = 1e5 + 10;
int n , q  ;
string s ;

void go(){
   cin >> n >> s >> q;
   bool f = 1;
   for(int i = 0 ; i < q ; i++){
     int t , a , b ; 
     cin >> t >> a >> b;
     if(!f){
       if(a>n)a-=n;else a+=n ;
       if(b>n)b-=n;else b+=n ;
     }
     if(t==1){
          swap(s[a-1],s[b-1]);
     }else{
        f=f^1;
     }
   }
   if(!f){
     for(int i = n ; i < 2*n ; i++)cout << s[i];
     for(int i = 0 ; i < n ; i++)cout << s[i];
   }else{
     cout << s;
   }
} 

signed main() {
        // freopen("input.txt", "r", stdin);
        // freopen("output.txt", "w", stdout);
        NeedForSpeed
        int t = 1;
        cout << fixed << setprecision(12) ;
        // cin >> t;
        while(t--){
            // cout << "Case #" << cases << ": ";
            go();
        }

}
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
#define FORall(it, a) for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define sz(a) int((a).size())
#define present(t, x) (t.find(x) != t.end())
#define all(a) (a).begin(), (a).end()
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define prec(n) fixed<<setprecision(n)
#define bit(n, i) (((n) >> (i)) & 1)
#define bitcount(n) __builtin_popcountll(n)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vii;
//const int MOD = (int) 1e9 + 7;
const int MOD = 119 << 23 | 1;
const int FFTMOD = 119 << 23 | 1;
const int INF = (int) 1e9 + 23111992;
const ll LINF = (ll) 1e18 + 23111992;
const ld PI = acos((ld) -1);
const ld EPS = 1e-9;
inline ll gcd(ll a, ll b) {ll r; while (b) {r = a % b; a = b; b = r;} return a;}
inline ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
inline ll fpow(ll n, ll k, int p = MOD) {ll r = 1; for (; k; k >>= 1) {if (k & 1) r = r * n % p; n = n * n % p;} return r;}
template<class T> inline int chkmin(T& a, const T& val) {return val < a ? a = val, 1 : 0;}
template<class T> inline int chkmax(T& a, const T& val) {return a < val ? a = val, 1 : 0;}
inline ull isqrt(ull k) {ull r = sqrt(k) + 1; while (r * r > k) r--; return r;}
inline ll icbrt(ll k) {ll r = cbrt(k) + 1; while (r * r * r > k) r--; return r;}
inline void addmod(int& a, int val, int p = MOD) {if ((a = (a + val)) >= p) a -= p;}
inline void submod(int& a, int val, int p = MOD) {if ((a = (a - val)) < 0) a += p;}
inline int mult(int a, int b, int p = MOD) {return (ll) a * b % p;}
inline int inv(int a, int p = MOD) {return fpow(a, p - 2, p);}
inline int sign(ld x) {return x < -EPS ? -1 : x > +EPS;}
inline int sign(ld x, ld y) {return sign(x - y);}
mt19937 mt(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int mrand() {return abs((int) mt());}
inline int mrand(int k) {return abs((int) mt()) % k;}
#define db(x) cerr << "[" << #x << ": " << (x) << "] ";
#define endln cerr << "\n";

void chemthan() {
    int n, m, k; cin >> n >> m >> k;
    vector<string> s(n);
    FOR(i, 0, n) FOR(j, 0, m) s[i] += "z";
    FOR(i, 0, k) {
        int u, v; cin >> u >> v; u--, v--;
        cin >> s[u][v];
    }
    vector<vi> dp(n, vi(m));
    int iv = inv(3);
    dp[0][0] = fpow(3, n * m - k);
    FOR(i, 0, n) FOR(j, 0, m) {
        if (s[i][j] == 'R') {
            if (j + 1 < m) {
                addmod(dp[i][j + 1], dp[i][j]);
            }
        }
        else if (s[i][j] == 'D') {
            if (i + 1 < n) {
                addmod(dp[i + 1][j], dp[i][j]);
            }
        }
        else if (s[i][j] == 'X') {
            if (j + 1 < m) {
                addmod(dp[i][j + 1], dp[i][j]);
            }
            if (i + 1 < n) {
                addmod(dp[i + 1][j], dp[i][j]);
            }
        }
        else {
            if (j + 1 < m) {
                addmod(dp[i][j + 1], mult(iv, 2 * dp[i][j]));
            }
            if (i + 1 < n) {
                addmod(dp[i + 1][j], mult(iv, 2 * dp[i][j]));
            }
        }
    }
    cout << dp[n - 1][m - 1] << "\n";
}

int32_t main(int32_t argc, char* argv[]) {
    ios_base::sync_with_stdio(0), cin.tie(0);
    if (argc > 1) {
        assert(freopen(argv[1], "r", stdin));
    }
    if (argc > 2) {
        assert(freopen(argv[2], "wb", stdout));
    }
    chemthan();
    cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}
