#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld; 
typedef double db; 
typedef string str; 

typedef pair<int, int> pi;
typedef pair<ll,ll> pl; 
typedef pair<ld,ld> pd; 
#define mp make_pair
#define f first
#define s second

typedef vector<int> vi; 
typedef vector<ll> vl; 
typedef vector<ld> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi; 
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back() 
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353; // = (119<<23)+1
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = 4*atan((ld)1); 
const int xd[4] = {0,1,0,-1}, yd[4] = {1,0,-1,0}; 

template<class T> bool ckmin(T& a, const T& b) { 
	return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
	return a < b ? a = b, 1 : 0; }
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());

#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;

template <class T> using Tree = tree<T, null_type, less<T>, 
	rb_tree_tag, tree_order_statistics_node_update>; 
// change null_type for map
#define ook order_of_key
#define fbo find_by_order

void treeExample() {
	Tree<int> t, t2; t.insert(8);
	auto it = t.insert(10).f; assert(it == t.lb(9));
	assert(t.ook(10) == 1); assert(t.ook(11) == 2);
	assert(*t.fbo(0) == 8);
	t.join(t2); // assuming T < T2 or T > T2, merge t2 into t
}

namespace input {
	template<class T> void re(complex<T>& x);
	template<class T1, class T2> void re(pair<T1,T2>& p);
	template<class T> void re(vector<T>& a);
	template<class T, size_t SZ> void re(array<T,SZ>& a);

	template<class T> void re(T& x) { cin >> x; }
	void re(double& x) { string t; re(t); x = stod(t); }
	void re(ld& x) { string t; re(t); x = stold(t); }
	template<class T, class... Ts> void re(T& t, Ts&... ts) { 
		re(t); re(ts...); 
	}

	template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
	template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
	template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
	template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}

using namespace input;

namespace output {
	void pr(int x) { cout << x; }
	void pr(long x) { cout << x; }
	void pr(ll x) { cout << x; }
	void pr(unsigned x) { cout << x; }
	void pr(unsigned long x) { cout << x; }
	void pr(unsigned long long x) { cout << x; }
	void pr(float x) { cout << x; }
	void pr(double x) { cout << x; }
	void pr(ld x) { cout << x; }
	void pr(char x) { cout << x; }
	void pr(const char* x) { cout << x; }
	void pr(const string& x) { cout << x; }
	void pr(bool x) { pr(x ? "true" : "false"); }
	template<class T> void pr(const complex<T>& x) { cout << x; }
	
	template<class T1, class T2> void pr(const pair<T1,T2>& x);
	template<class T> void pr(const T& x);
	
	template<class T, class... Ts> void pr(const T& t, const Ts&... ts) { 
		pr(t); pr(ts...); 
	}
	template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
		pr("{",x.f,", ",x.s,"}"); 
	}
	template<class T> void pr(const T& x) { 
		pr("{"); // const iterator needed for vector<bool>
		bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; 
		pr("}");
	}
	
	void ps() { pr("\n"); } // print w/ spaces
	template<class T, class... Ts> void ps(const T& t, const Ts&... ts) { 
		pr(t); if (sizeof...(ts)) pr(" "); ps(ts...); 
	}
	
	void pc() { pr("]\n"); } // debug w/ commas
	template<class T, class... Ts> void pc(const T& t, const Ts&... ts) { 
		pr(t); if (sizeof...(ts)) pr(", "); pc(ts...); 
	}
	#define dbg(x...) pr("[",#x,"] = ["), pc(x);
}

using namespace output;

namespace io {
	void setIn(string s) { freopen(s.c_str(),"r",stdin); }
	void setOut(string s) { freopen(s.c_str(),"w",stdout); }
	void setIO(string s = "") {
		ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
		// cin.exceptions(cin.failbit); // ex. throws exception when you try to read letter into int
		if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
	}
}

using namespace io;

struct mi {
	typedef decay<decltype(MOD)>::type T;
	T val; 
	explicit operator T() const { return val; }
	mi() { val = 0; }
	mi(ll v) { 
		val = (-MOD <= v && v <= MOD) ? v : v % MOD;
		if (val < 0) val += MOD;
	}
	friend bool operator==(const mi& a, const mi& b) { 
		return a.val == b.val; }
	friend bool operator!=(const mi& a, const mi& b) { 
		return !(a == b); }
	friend bool operator<(const mi& a, const mi& b) { 
		return a.val < b.val; }
	friend void re(mi& a) { ll x; re(x); a = mi(x); }
	friend void pr(const mi& a) { pr(a.val); }
	friend ostream& operator<<(ostream& os, const mi& a) { 
		return os << a.val; }
   
	mi operator-() const { return mi(-val); }
	mi& operator+=(const mi& m) { 
		if ((val += m.val) >= MOD) val -= MOD; 
		return *this; }
	mi& operator-=(const mi& m) { 
		if ((val -= m.val) < 0) val += MOD; 
		return *this; }
	mi& operator++() { return *this += 1; }
	mi& operator--() { return *this -= 1; }
	friend mi operator+(mi a, const mi& b) { return a += b; }
	friend mi operator-(mi a, const mi& b) { return a -= b; }

	mi& operator*=(const mi& m) { 
		val = (ll)val*m.val%MOD; return *this; }
	friend mi pow(mi a, ll p) {
		mi ans = 1; assert(p >= 0);
		for (; p; p /= 2, a *= a) if (p&1) ans *= a;
		return ans;
	}
	friend mi inv(const mi& a) { 
		assert(!(a == 0)); return pow(a,MOD-2); }
	mi& operator/=(const mi& m) { return (*this) *= inv(m); }
	friend mi operator*(mi a, const mi& b) { return a *= b; }
	friend mi operator/(mi a, const mi& b) { return a /= b; }
};
typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;

int N,M,Q;
str S,T;
vi wNorth, wSouth, eNorth, eSouth;
vi nWest, nEast, sWest, sEast;

int hor(pi a, pi b, int c);
int ver(pi a, pi b, int c);

int checkH(int x, pi a, pi b, int c) {
	if (abs(x) == MOD) return MOD;
	if (S[a.f] == 'W') {
		if (!(x <= a.s)) return MOD;
	} else {
		if (!(x >= a.s)) return MOD;
	}
	return ver({a.f,x},b,c+1)+abs(x-a.s);
}

int hor(pi a, pi b, int c) {
	int res = MOD;
	if (S[a.f] == 'W') {
		if (a.f == b.f && b.s <= a.s) return a.s-b.s;
		if (c == 4) return res;
		if (b.s <= a.s) {
			if (b.f > a.f) {
				ckmin(res,checkH(wSouth[b.s],a,b,c));
				ckmin(res,checkH(eSouth[b.s],a,b,c));
				ckmin(res,checkH(wNorth[a.s],a,b,c));
			} else {
				ckmin(res,checkH(wNorth[b.s],a,b,c));
				ckmin(res,checkH(eNorth[b.s],a,b,c));
				ckmin(res,checkH(wSouth[a.s],a,b,c));
			}
		} else {
			ckmin(res,checkH(wNorth[a.s],a,b,c));
			ckmin(res,checkH(wSouth[a.s],a,b,c));
		}
	} else {
		if (a.f == b.f && a.s <= b.s) return b.s-a.s;
		if (c == 4) return res;
		int x = eSouth[a.s], y = eNorth[a.s];
		if (b.s >= a.s) {
			if (b.f > a.f) {
				ckmin(res,checkH(wSouth[b.s],a,b,c));
				ckmin(res,checkH(eSouth[b.s],a,b,c));
				ckmin(res,checkH(eNorth[a.s],a,b,c));
			} else {
				ckmin(res,checkH(wNorth[b.s],a,b,c));
				ckmin(res,checkH(eNorth[b.s],a,b,c));
				ckmin(res,checkH(eSouth[a.s],a,b,c));
			}
		} else {
			ckmin(res,checkH(eNorth[a.s],a,b,c));
			ckmin(res,checkH(eSouth[a.s],a,b,c));
		}
	}
	return res;
}

int checkV(int y, pi a, pi b, int c) {
	if (abs(y) == MOD) return MOD;
	if (T[a.s] == 'N') {
		if (!(y <= a.f)) return MOD;
	} else {
		if (!(y >= a.f)) return MOD;
	}
	return hor({y,a.s},b,c+1)+abs(y-a.f);
}

int ver(pi a, pi b, int c) {
	int res = MOD;
	if (T[a.s] == 'N') {
		if (a.s == b.s && b.f <= a.f) return a.f-b.f;
		if (c == 4) return res;
		if (b.f <= a.f) {
			if (b.s > a.s) {
				ckmin(res,checkV(nEast[b.f],a,b,c));
				ckmin(res,checkV(sEast[b.f],a,b,c));
				ckmin(res,checkV(nWest[a.f],a,b,c));
			} else {
				ckmin(res,checkV(nWest[b.f],a,b,c));
				ckmin(res,checkV(sWest[b.f],a,b,c));
				ckmin(res,checkV(nEast[a.f],a,b,c));
			}
		} else {
			ckmin(res,checkV(nWest[a.f],a,b,c));
			ckmin(res,checkV(nEast[a.f],a,b,c));
		}
	} else {
		if (a.s == b.s && b.f >= a.f) return b.f-a.f;
		if (c == 4) return res;
		if (b.f >= a.f) {
			if (b.s > a.s) {
				ckmin(res,checkV(nEast[b.f],a,b,c));
				ckmin(res,checkV(sEast[b.f],a,b,c));
				ckmin(res,checkV(sWest[a.f],a,b,c));
			} else {
				ckmin(res,checkV(nWest[b.f],a,b,c));
				ckmin(res,checkV(sWest[b.f],a,b,c));
				ckmin(res,checkV(sEast[a.f],a,b,c));
			}
		} else {
			ckmin(res,checkV(sWest[a.f],a,b,c));
			ckmin(res,checkV(sEast[a.f],a,b,c));
		}
	}
	return res;
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	re(N,M,Q,S,T);
	wNorth.rsz(M), wSouth.rsz(M);
	F0R(i,M) {
		if (i == 0) wNorth[i] = wSouth[i] = -MOD;
		else wNorth[i] = wNorth[i-1], wSouth[i] = wSouth[i-1];
		if (T[i] == 'S') wSouth[i] = i;
		else wNorth[i] = i;
	}
	eNorth.rsz(M), eSouth.rsz(M);
	R0F(i,M) {
		if (i == M-1) eNorth[i] = eSouth[i] = -MOD;
		else eNorth[i] = eNorth[i+1], eSouth[i] = eSouth[i+1];
		if (T[i] == 'S') eSouth[i] = i;
		else eNorth[i] = i;
	}
	nWest.rsz(N), nEast.rsz(N);
	F0R(i,N) {
		if (i == 0) nWest[i] = nEast[i] = -MOD;
		else nWest[i] = nWest[i-1], nEast[i] = nEast[i-1];
		if (S[i] == 'E') nEast[i] = i;
		else nWest[i] = i;
	}
	sWest.rsz(N), sEast.rsz(N);
	R0F(i,N) {
		if (i == N-1) sWest[i] = sEast[i] = -MOD;
		else sWest[i] = sWest[i+1], sEast[i] = sEast[i+1];
		if (S[i] == 'E') sEast[i] = i;
		else sWest[i] = i;
	}
	F0R(i,Q) {
		int a,b,c,d; re(a,b,c,d); a--,b--,c--,d--;
		int res = min(hor({a,b},{c,d},0),ver({a,b},{c,d},0));
		ps(res == MOD ? -1 : res);
	}
	// you should actually read the stuff at the bottom
}

/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?), slow multiset operations
	* do smth instead of nothing and stay organized
*/

Measured memory_bytes: 4944