#include <bits/stdc++.h>
using namespace std;
template <class F, class T>
T convert(F a, int p = -1) {
  stringstream ss;
  if (p >= 0) ss << fixed << setprecision(p);
  ss << a;
  T r;
  ss >> r;
  return r;
}
template <class T>
T gcd(T a, T b) {
  T r;
  while (b != 0) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
template <class T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
template <class T>
T sqr(T x) {
  return x * x;
}
template <class T>
T cube(T x) {
  return x * x * x;
}
template <class T>
int getbit(T s, int i) {
  return (s >> i) & 1;
}
template <class T>
T onbit(T s, int i) {
  return s | (T(1) << i);
}
template <class T>
T offbit(T s, int i) {
  return s & (~(T(1) << i));
}
template <class T>
int cntbit(T s) {
  return s == 0 ? 0 : cntbit(s >> 1) + (s & 1);
}
const int bfsz = 1 << 16;
char bf[bfsz + 5];
int rsz = 0;
int ptr = 0;
char gc() {
  if (rsz <= 0) {
    ptr = 0;
    rsz = (int)fread(bf, 1, bfsz, stdin);
    if (rsz <= 0) return EOF;
  }
  --rsz;
  return bf[ptr++];
}
void ga(char &c) {
  c = EOF;
  while (!isalpha(c)) c = gc();
}
int gs(char s[]) {
  int l = 0;
  char c = gc();
  while (isspace(c)) c = gc();
  while (c != EOF && !isspace(c)) {
    s[l++] = c;
    c = gc();
  }
  s[l] = '\0';
  return l;
}
template <class T>
bool gi(T &v) {
  v = 0;
  char c = gc();
  while (c != EOF && c != '-' && !isdigit(c)) c = gc();
  if (c == EOF) return false;
  bool neg = c == '-';
  if (neg) c = gc();
  while (isdigit(c)) {
    v = v * 10 + c - '0';
    c = gc();
  }
  if (neg) v = -v;
  return true;
}
const double PI = acos(-1.0);
const double eps = 1e-9;
const int dr[] = {-1, 0, +1, 0};
const int dc[] = {0, +1, 0, -1};
const int inf = (int)1e9 + 5;
const long long linf = (long long)1e17 + 5;
const long long mod = 1000000007;
int n, m;
int r, c, h;
map<pair<int, int>, int> M;
map<pair<pair<int, int>, int>, int> M1;
long long res = 0;
string str[4] = {"UL", "UR", "DR", "DL"};
string s;
int main() {
  cin >> n >> m;
  cin >> r >> c >> s;
  for (int i = 0; i < (4); ++i)
    if (str[i].compare(s) == 0) {
      h = i;
      break;
    }
  int rr, cc, run = 1;
  ;
  M.clear();
  res++;
  M[make_pair(r, c)] = 1;
  M1[make_pair(make_pair(r, c), h)] = 1;
  while (run < n + m - 2) {
    if (h == 0) {
      rr = r - c + 1;
      cc = 1;
      if (rr < 1) {
        cc = cc - rr + 1;
        rr = 1;
      }
      if (rr == 1 && cc == 1)
        h = 2;
      else if (rr == 1)
        h = 3;
      else if (cc == 1)
        h = 1;
    } else if (h == 1) {
      rr = r - m + c;
      cc = m;
      if (rr < 1) {
        cc = cc + rr - 1;
        rr = 1;
      }
      if (rr == 1 && cc == m)
        h = 3;
      else if (rr == 1)
        h = 2;
      else if (cc == m)
        h = 0;
    } else if (h == 2) {
      rr = r + m - c;
      cc = m;
      if (rr > n) {
        cc = cc - rr + n;
        rr = n;
      }
      if (rr == n && cc == m)
        h = 0;
      else if (rr == n)
        h = 1;
      else if (cc == m)
        h = 3;
    } else {
      rr = r + c - 1;
      cc = 1;
      if (rr > n) {
        cc = cc + rr - n;
        rr = n;
      }
      if (rr == n && cc == 1)
        h = 1;
      else if (rr == n)
        h = 0;
      else if (cc == 1)
        h = 2;
    }
    if (M1[make_pair(make_pair(rr, cc), h)]) break;
    if (!M[make_pair(rr, cc)]) run++;
    M[make_pair(rr, cc)] = 1;
    M1[make_pair(make_pair(rr, cc), h)] = 1;
    res += abs(r - rr);
    r = rr;
    c = cc;
  }
  if (run < n + m - 2) {
    cout << -1;
    return 0;
  }
  cout << res;
  return 0;
}
