#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")

#include <bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define sz(v) int(v.size())

using namespace std;
using ll = int64_t;

int N, M, Q;
string S, T;
map<int, vector<int>> xPositions;
map<int, vector<int>> yPositions;
vector<int> interestingX;
vector<int> interestingY;
queue<pair<int,int>> q;

int distances[10][10];

void build() {
  for (int i = 0; i < N; i++)
    xPositions[S[i] == 'E' ? 1 : -1].pb(i);
  for (int i = 0; i < M; i++)
    yPositions[T[i] == 'S' ? 1 : -1].pb(i);
}

int Next(const vector<int>& v, int x) {
  auto it = lower_bound(all(v), x);
  if (it == v.end())
    return -1;
  return *it;
}

int Prev(const vector<int>& v, int x) {
  auto it = upper_bound(all(v), x);
  if (it == v.begin())
    return -1;
  --it;
  return *it;
}

void filter(vector<int>& v) {
  sort(all(v));
  v.erase(unique(all(v)), v.end());
  while (!v.empty() && v.front() == -1)
    v.erase(v.begin());
}

int ans(int x0, int y0, int x1, int y1) {
  interestingX.clear();
  interestingY.clear();
  
  interestingX.pb(x0);
  interestingX.pb(x1);
  interestingY.pb(y0);
  interestingY.pb(y1);
  for (int d = -1; d <= 1; d++) {
    interestingX.pb(Next(xPositions[d], x0));
    interestingX.pb(Prev(xPositions[d], x0));
    interestingX.pb(Next(xPositions[d], x1));
    interestingX.pb(Prev(xPositions[d], x1));

    interestingY.pb(Next(yPositions[d], y0));
    interestingY.pb(Prev(yPositions[d], y0));
    interestingY.pb(Next(yPositions[d], y1));
    interestingY.pb(Prev(yPositions[d], y1));
  }

  filter(interestingX);
  filter(interestingY);

  auto getX = [&](int x) {
    return lower_bound(all(interestingX), x) - interestingX.begin();
  };

  auto getY = [&](int y) {
    return lower_bound(all(interestingY), y) - interestingY.begin();
  };

  memset(distances, -1, sizeof(distances));
  x0 = getX(x0);
  y0 = getY(y0);
  x1 = getX(x1);
  y1 = getY(y1);
  distances[x0][y0] = 0;
  q.push({x0, y0});

  while (!q.empty()) {
    auto p = q.front();
    q.pop();
    int d = distances[p.fi][p.se];
    // cerr << "debug: " << p.fi << " " << p.se << " " << d << endl;

    // go x
    int lx = 0, rx = sz(interestingX) - 1;
    if (T[interestingY[p.se]] == 'S') lx = p.fi + 1;
    if (T[interestingY[p.se]] == 'N') rx = p.fi - 1;
    for (int nx = lx; nx <= rx; nx++) {
      int nd = d + abs(interestingX[nx] - interestingX[p.fi]);
      if (distances[x1][y1] != -1 && distances[x1][y1] <= nd)
        continue;
      if (distances[nx][p.se] == -1 || distances[nx][p.se] > nd) {
        distances[nx][p.se] = nd;
        q.push({nx, p.se});
      }
    }

    // go y
    int ly = 0, ry = sz(interestingY) - 1;
    if (S[interestingX[p.fi]] == 'E') ly = p.se + 1;
    if (S[interestingX[p.fi]] == 'W') ry = p.se - 1;
    for (int ny = ly; ny <= ry; ny++) {
      int nd = d + abs(interestingY[ny] - interestingY[p.se]);
      if (distances[x1][y1] != -1 && distances[x1][y1] <= nd)
        continue;
      if (distances[p.fi][ny] == -1 || distances[p.fi][ny] > nd) {
        distances[p.fi][ny] = nd;
        q.push({p.fi, ny});
      }
    }
  }

  return distances[x1][y1];
}

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

  cin >> N >> M >> Q;
  cin >> S >> T;

  build();

  for (int i = 0; i < Q; i++) {
    int x0, y0, x1, y1;
    cin >> x0 >> y0 >> x1 >> y1;
    --x0, --y0, --x1, --y1;
    cout << ans(x0, y0, x1, y1) << "\n";
  }

  return 0;
}
