#include <bits/stdc++.h>
using namespace std;
const long double EPS = 0.001;
const long double EPS2 = 1e-6;
const long double PI = acos(-1);
int mod = (int)998244353;
const int MOD7 = 1000000007;
const int MOD9 = 1000000009;
const int a228 = 18;
const int inf = 1e9;
const long long kekmod = 1791791791;
const long long bestmod = 1148822869;
long long sgn(long long x) {
  if (x > 0) return 1;
  if (x < 0) return -1;
  return 0;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cout.tie(0);
  cin.tie(0);
  srand(time(NULL));
  long long x1, y1, x2, y2;
  cin >> x1 >> y1 >> x2 >> y2;
  long long n;
  cin >> n;
  string s;
  cin >> s;
  pair<long long, long long> sum;
  long long x = 0, y = 0;
  for (long long i = 0; i < s.size(); ++i) {
    if (s[i] == 'U')
      y++;
    else if (s[i] == 'D')
      y--;
    else if (s[i] == 'L')
      x--;
    else if (s[i] == 'R')
      x++;
  }
  long long dx = x2 - x1;
  long long dy = y2 - y1;
  long long l = -1, r = 1e9;
  while (r - l > 1) {
    long long m = (l + r) / 2;
    long long tx = x1 + m * x;
    long long ty = y1 + m * y;
    if (abs(ty - y2) + abs(tx - x2) <= m * n) {
      r = m;
    } else
      l = m;
  }
  r--;
  long long tx = r * x;
  long long ty = r * y;
  x1 += tx;
  y1 += ty;
  if (abs(x1 - x2) + abs(y1 - y2) <= r * n) {
    cout << r * n;
    return 0;
  }
  bool f = 0;
  for (long long i = 0; i < s.size(); ++i) {
    if (s[i] == 'U')
      y1++;
    else if (s[i] == 'D')
      y1--;
    else if (s[i] == 'L')
      x1--;
    else if (s[i] == 'R')
      x1++;
    if (abs(x1 - x2) + abs(y1 - y2) <= r * n + i + 1) {
      cout << r * n + i + 1;
      return 0;
    }
  }
  cout << -1;
}
