#include <iostream>
#include <algorithm> // for sort, mainly
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <array>
#include <string>
#include <cstdio>
#include <iterator>
#include <unordered_set>
#include <cstdint> // for int64_t, int32_t, etc
#include <queue>
#include <stack>
#include <deque>
#include <numeric> // gcd, lcm
#include <fstream>
#include <bitset> // for bitset
#include <iomanip>
#include <cassert> // for set with custom ordering
#include <type_traits> // for set with custom ordering
#include <utility> // for swap, forward, etc
using namespace std;

#pragma GCC optimize("O2")
// #pragma GCC optimize("O1","O2","O3","Ofast","unroll-loops")
// #pragma GCC target("sse","sse2","sse3","sse4.1","sse4.2","avx","avx2","fma")

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#ifdef LOCAL
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

/*

notes:

int64_t
stoi(string s) -> string to int
to_string() -> int (or else) to string

vector declaration:
vector<ll> v(n, 0)
vector<vector<ll>> v(n, vector<ll>(n, 0));

{if statement} ? {truth value} : {false value}

#ifdef LOCAL
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
#endif

std::lcm(ll a, ll b), std::gcd(int a, int b)

cout << fixed << setprecision(n);

set with custom ordering
set<ll, decltype(&cmp)> qu(cmp);

*/

typedef long double ld;
typedef int64_t ll;

ll inf = 1e18;

ll solve1(ll dx, ll dy, ll ds, ll bx, ll by, ll bs, char dir) {

	pair<ll,ll> go;
	if(dir == 'U') {
		go = {0, 1};
	}else if(dir == 'D') {
		go = {0, -1};
	}else if(dir == 'L') {
		go = {-1, 0};
	}else if(dir == 'R')
	{
		go = {1, 0};
	}

	if(bx == dx && dy == by) {
		return 0;
	}

	if(bs == 0) {
		ll res = abs(bx - dx) + abs(by - dy);
		return (res + ds - 1)/ds;
	}

	ll prev = inf;

	ll st = 0; // start time
	// amikor a kutya eler a gomb konstans kordinatajara

	bool fele = false;
	ll d = 0; // kutya-labda tavolsag a fo tengelyen

	ll td = 0; // total distance (by dog)

	if(go.first != 0) {
		// x-en megy

		ll dis = abs(by - dy);

		ll extra = dis - (dis / ds) * ds;
		dx += go.first * extra;

		//cerr << "\ndis=" << dis << "; extra=" << extra;

		st = (dis + ds - 1)/ds;

		bx += go.first * bs * st;

		if(bx == dx) {
			return st;
		}

		if(bx < dx) {
			// labda a kutyatol ballra van
			if(go.first == 1) {
				fele = true;
			}
		}else{
			// labda a kutyatol jobbra van
			if(go.first == -1) {
				fele = true;
			}
		}

		d = abs(dx - bx);

	}else{
		// y-on megy

		ll dis = abs(bx - dx);

		st = (dis + ds - 1)/ds;
		ll extra = dis - (dis / ds) * ds;
		dy += go.second * extra;

		//cerr << "\ndis=" << dis << "; extra=" << extra;

		by += go.second * bs * st;

		if(by == dy) {
			return st;
		}
		
		if(by > dy) {
			// labda fellette van
			if(go.second == -1) {
				fele = true;
			}
		}else{
			// labda alatta van
			if(go.second == 1) {
				fele = true;
			}
		}

		d = abs(dy - by);
	}

	//cerr << "\nst=" << st;
	//cerr << "\nfele=" << fele << "; d=" << d;

	//cerr << "\ndx=" << dx << "; dy=" << dy;
	//cerr << "\nbx=" << bx << "; by=" << by;

	if(fele == true) {

		ll ts = ds + bs; // total speed

		ll ht = (d + ts - 1)/ts; // here time

		ll ans = st + ht;

		return ans;

	}else{

		if(bs >= ds) {
			return -1;
		}

		ll ts = ds - bs;
		ll ht = (d + ts - 1)/ ts;

		return st + ht;

	}
	
}

ll solve2(ll dx, ll dy, ll ds, ll bx, ll by, ll bs, char dir) {

	pair<ll,ll> go;
	if(dir == 'U') {
		go = {0, 1};
	}else if(dir == 'D') {
		go = {0, -1};
	}else if(dir == 'L') {
		go = {-1, 0};
	}else if(dir == 'R')
	{
		go = {1, 0};
	}

	if(bx == dx && dy == by) {
		return 0;
	}

	if(bs == 0) {
		ll res = abs(bx - dx) + abs(by - dy);
		return (res + ds - 1)/ds;
	}

	ll inf = 1e18;

	for(ll t = 0; t <= 6 * 1e7; t++) {

		ll curr = abs(bx - dx) + abs(by - dy);

		ll tohere = (curr+ ds - 1)/ds;

		//cerr << "\nbx=" << bx << "; by=" << by;
		//cerr << "\ntohere=" << tohere;
		//cerr << "\ntime=" << time;

		if(tohere <= t) {
			return t;
		}

		bx += go.first * bs;
		by += go.second * bs;
	}
	
	return -1;

}

int main()
{
	std::ios_base::sync_with_stdio(false);
	//cin.tie(nullptr);
	//cout.tie(nullptr);

	ll dx, dy, ds;
	cin >> dx >> dy >> ds;

	ll bx, by, bs;
	cin >> bx >> by >> bs;

	char dir;
	cin >> dir;

	ll s1 = solve1(dx, dy, ds, bx, by, bs, dir);
	ll s2 = solve2(dx, dy, ds, bx, by, bs, dir);

	if(s1 == -1 && s2 == -1) {
		cout << -1;
	}else if(s1 != -1 && s2 == -1) {
		cout << s1;
	}else{

		if(s1 == s2) {
			cout << s1;
		}else{
			cout << s2;
		}
	}

	return 0;
}