#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100000;
const long long INF = 1000000000000000000L;
long long dx[MAXN], dy[MAXN];
int main() {
  long long x1, y1, x2, y2;
  cin >> x1 >> y1 >> x2 >> y2;
  int N;
  cin >> N;
  memset(dx, 0, sizeof(dx));
  memset(dy, 0, sizeof(dy));
  string S;
  cin >> S;
  int len = S.length();
  for (int i = 0; i < len; ++i) {
    if (S[i] == 'U') {
      dy[i] = 1;
    }
    if (S[i] == 'D') {
      dy[i] = -1;
    }
    if (S[i] == 'L') {
      dx[i] = -1;
    }
    if (S[i] == 'R') {
      dx[i] = 1;
    }
    if (i > 0) {
      dx[i] += dx[i - 1];
      dy[i] += dy[i - 1];
    }
  }
  long long l = 0, r = INF;
  while (l < r) {
    long long mid = (l + r) / 2;
    long long nowx1 = x1 + (mid / N) * dx[N - 1],
              nowy1 = y1 + (mid / N) * dy[N - 1];
    if (mid % N > 0) {
      nowx1 += dx[mid % N - 1];
      nowy1 += dy[mid % N - 1];
    }
    if (abs(x2 - nowx1) + abs(y2 - nowy1) <= mid) {
      r = mid;
    } else {
      l = mid + 1;
    }
  }
  cout << (l == INF ? -1 : l) << endl;
  return 0;
}
