/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author Kein Yukiyoshi
 */

// clang-format off
#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
#define int long long
using namespace std;
#define stoi stoll
#define fi first
#define se second
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; i++)
#define rep2(i, a, b) for (int i = (int)(a), i##_len=(b); i < i##_len; i++)
#define rep3(i, a, b) for (int i = (int)(a), i##_len=(b); i >= i##_len; i--)
#define FOR(i, a) for (auto &i: a)
#define ALL(obj) begin(obj), end(obj)
#define _max(x) *max_element(ALL(x))
#define _min(x) *min_element(ALL(x))
#define _sum(x) accumulate(ALL(x), 0LL)

const int MOD    = 998244353;
const int INF    = (int)(1e13 + 7);
const double EPS = 1e-8;
const double PI  = 3.14159265358979;
template <class T> using V = vector<T>;
template <class T> using VV = vector<vector<T>>;
template <class T> using VVV = vector<vector<vector<T>>>;
template <class T, class S>  using P = pair<T, S>;
template<class T> bool chmax(T &a, const T &b) {if (a < b) {a = b;return true;}return false;}
template<class T> bool chmin(T &a, const T &b) {if (b < a) {a = b;return true;}return false;}
int _ceil(int a, int b) { return (a >= 0 ? (a + (b - 1)) / b : (a - (b - 1)) / b); }
int _mod(int a) {return a >= 0 ? a % MOD : a - (MOD * _ceil(a, MOD));}
int _pow(int a, int b) {int res = 1;for (a %= MOD; b; a = a * a % MOD, b >>= 1)if (b & 1) res = res * a % MOD;return res;}
struct mint {long long x;mint(long long x = 0) : x((x % MOD + MOD) % MOD) {}mint operator-() const { return mint(-x); }mint &operator+=(const mint a) {if ((x += a.x) >= MOD) x -= MOD;return *this;}mint &operator-=(const mint a) {if ((x += MOD - a.x) >= MOD) x -= MOD;return *this;}mint &operator*=(const mint a) { (x *= a.x) %= MOD;return *this; }mint operator+(const mint a) const { return mint(*this) += a; }mint operator-(const mint a) const { return mint(*this) -= a; } mint operator*(const mint a) const { return mint(*this) *= a; }mint pow(long long t) const {if (!t) return 1;mint a = pow(t >> 1);a *= a;if (t & 1) a *= *this;return a;}mint inv() const { return pow(MOD - 2); }mint &operator/=(const mint a) { return *this *= a.inv(); }mint operator/(const mint a) const { return mint(*this) /= a; }};istream &operator>>(istream &is, mint &a) { return is >> a.x; }ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
// clang-format on

int x, y;
int ext_gcd(int a, int b, int &x, int &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return 0;
  }
  int d = ext_gcd(b, a % b, y, x);
  y -= a / b * x;
  return d;
}

int inv(int n) {
  ext_gcd(n, MOD, x, y);
  return x;
}

class CRobotOnGrid {
public:
  static void solve(istream &cin, ostream &cout) {
    cin.tie(nullptr);
    cout.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
    int H, W, K;
    cin >> H >> W >> K;
    int INV = inv(3);
    VV<char> grid2(H + 2, V<char>(W + 2));
    rep(i, K) {
      int h, w;
      char c;
      cin >> h >> w >> c;
      grid2[h][w] = c;
    }
    VV<mint> grid(H + 2, V<mint>(W + 2));
    grid[1][1] = _pow(3, H * W - K);
    rep2(i, 1, H + 1) {
      rep2(j, 1, W + 1) {
        if (grid2[i][j]) {
          if (grid2[i][j] == 'R') {
            grid[i][j + 1] += grid[i][j];
          } else if (grid2[i][j] == 'D') {
            grid[i + 1][j] += grid[i][j];
          } else {
            grid[i][j + 1] += grid[i][j];
            grid[i + 1][j] += grid[i][j];
          }
        } else {
          grid[i + 1][j] += grid[i][j] * INV;
          grid[i + 1][j] += grid[i][j] * INV;
          grid[i][j + 1] += grid[i][j] * INV;
          grid[i][j + 1] += grid[i][j] * INV;
        }
      }
    }
    cout << grid[H][W] << endl;
  }
};


signed main() {
  CRobotOnGrid solver;
  std::istream& in(std::cin);
  std::ostream& out(std::cout);
  solver.solve(in, out);
  return 0;
}

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define Rep(i,j,n) for(int i = j; i < (int)(n); i++)
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

int main(){
    ll a,b,c;
    cin >> a >> b >> c;
    if(a == 0 && b == 0) {
        cout << '=' << endl;
    }else if(a == b){
        cout << '=' << endl;
    }else if(a >= 0 && b >= 0){
        if(a > b) cout << '>' << endl;
        else if(a == b) cout << '=' << endl;
        else cout << '<' << endl;
    }else if(a >= 0 && b < 0){
        if(c%2 == 0){
            b *= -1;
            if(a == b) cout << '=' << endl;
            else if(a > b) cout << '>' << endl;
            else cout << '<' << endl;
        }else{
            cout << '>' << endl;
        }
    }else if(a < 0 && b >= 0){
        if(c%2 == 0){
            a *= -1;
            if(a > b) cout << '>' << endl;
            else if(a == b) cout << '=' << endl;
            else cout << '<' << endl;
        }else{
            cout << '<' << endl;
        }
    }else{
        if(c%2 == 0){
            a *= -1;
            b *= -1;
            if(a > b) cout << '>' << endl;
            else if(a == b) cout << '=' << endl;
            else cout << '<' << endl;
        }else{
            if(a > b) cout << '>' << endl;
            else if(a == b) cout << '=' << endl;
            else cout << '<' << endl;
        }
    }
    return 0;
}