#include <bits/stdc++.h>
using namespace std;
long long x, y, n, mid, l, r, a, b;
long long cx[100001], cy[100001], ans = -1;
string s;
bool xas(long long m) {
  long long d = m % n;
  long long e = m / n;
  long long xd = e * cx[n] + cx[d] + x;
  long long xe = e * cy[n] + cy[d] + y;
  long long z = abs(xd - a) + abs(xe - b);
  return z <= m;
}
int main() {
  cin >> x >> y >> a >> b >> n;
  cin >> s;
  for (int i = 0; i < n; i++) {
    cx[i + 1] = cx[i];
    cy[i + 1] = cy[i];
    if (s[i] == 'U') cy[i + 1]++;
    if (s[i] == 'D') cy[i + 1]--;
    if (s[i] == 'R') cx[i + 1]++;
    if (s[i] == 'L') cx[i + 1]--;
  }
  r = 1e18;
  while (l <= r) {
    mid = (l + r) / 2;
    if (xas(mid))
      r = mid - 1, ans = mid;
    else
      l = mid + 1;
  }
  cout << ans;
  return 0;
}
