// clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define forever for (;;)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
template<typename A> using V = std::vector<A>;
template<typename A> using F = std::function<A>;
template<typename A, typename B> using P = std::pair<A, B>;
using pii = P<int, int>;
using vi = V<int>;
using vd = V<double>;
using vs = V<std::string>;
using vpii = V<pii>;
using vvi = V<vi>;
using vvpii = V<vpii>;
constexpr int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979;
template<typename A, typename B> bool cmin(A &a, const B &b) { return a > b ? (a = b, true) : false; }
template<typename A, typename B> bool cmax(A &a, const B &b) { return a < b ? (a = b, true) : false; }
constexpr bool odd(const int n) { return n & 1; }
constexpr bool even(const int n) { return ~n & 1; }
template<typename T> std::istream &operator>>(std::istream &is, std::vector<T> &v) { for (T &x : v) is >> x; return is; }
template<typename A, typename B> std::istream &operator>>(std::istream &is, std::pair<A, B> &p) { is >> p.first >> p.second; return is; }
using namespace std;
// clang-format on

using namespace std;

using Weight = int;
struct Edge {
  int src, dst;
  Weight weight;
  Edge(const int s = 0, const int d = 0, const Weight w = 0) : src(s), dst(d), weight(w) {}
};

using Edges = std::vector<Edge>;
using Array = std::vector<Weight>;
using Matrix = std::vector<Array>;

class Graph {
  std::vector<Edges> g;
  using iterator = std::vector<Edges>::iterator;
  using const_iterator = std::vector<Edges>::const_iterator;

public:
  Graph(const int size = 0) : g(size) {}
  size_t size() const { return g.size(); }
  const Edges &operator[](const int i) const { return g[i]; }
  void addArc(const int src, const int dst, const Weight w = 1) { g[src].emplace_back(src, dst, w); }
  void addEdge(const int node1, const int node2, const Weight w = 1) {
    addArc(node1, node2, w);
    addArc(node2, node1, w);
  }
  iterator begin() { return g.begin(); }
  const_iterator begin() const { return g.begin(); }
  iterator end() { return g.end(); }
  const_iterator end() const { return g.end(); }
};

template<int inf = std::numeric_limits<Weight>::max() / 8> std::pair<std::vector<Weight>, std::vector<int>> dijkstra(const Graph &g, const int src) {
  using state = std::pair<Weight, int>;
  std::priority_queue<state, std::vector<state>, std::greater<state>> q;
  std::vector<Weight> dist(g.size(), inf);
  std::vector<int> via(g.size());
  dist[src] = 0;
  q.emplace(0, src);
  while (q.size()) {
    Weight d;
    int v;
    std::tie(d, v) = q.top();
    q.pop();
    if (dist[v] < d) continue;
    for (auto &e : g[v]) {
      if (cmin(dist[e.dst], dist[v] + e.weight)) {
        via[e.dst] = v;
        q.emplace(dist[e.dst], e.dst);
      }
    }
  }
  return {dist, via};
}

int di[4] = {1, 0, -1, 0}, dj[4] = {0, 1, 0, -1};

main {
  int H, W;
  char s, t;
  cin >> H >> W >> s >> t;
  vector<vector<char>> m(H, vector<char>(W));
  int S, G;
  rep(i, H) {
    rep(j, W) {
      cin >> m[i][j];
      if (isupper(m[i][j])) {
        if (m[i][j] == s) S = i * W + j;
        if (m[i][j] == t) G = i * W + j;
        m[i][j] = 'o';
      }
    }
  }

  Graph g(H * W);
  rep(i, H) rep(j, W) {
    rep(k, 4) {
      int i2 = i + di[k], j2 = j + dj[k];
      if (i2 < 0 || j2 < 0 || i2 >= H || j2 >= W) continue;
      if (m[i][j] == '-') {
        if ((k==1||k==3)&&m[i2][j2] == 'o') {
          g.addArc(i * W + j, i2 * W + j2, 1);
        } else if (m[i2][j2] == '-') {
          g.addArc(i * W + j, i2 * W + j2, 0);
        }
      } else if (m[i][j] == '|') {
        if ((k==0||k==2)&&m[i2][j2] == 'o') {
          g.addArc(i * W + j, i2 * W + j2, 1);
        } else if (m[i2][j2] == '|') {
          g.addArc(i * W + j, i2 * W + j2, 0);
        }
      } else if (m[i][j] == 'o') {
        if (m[i2][j2] == 'o') {
          g.addArc(i * W + j, i2 * W + j2, 0);
        } else if (((k==1||k==3)&&m[i2][j2] == '-') ||((k==0||k==2)&& m[i2][j2] == '|')) {
          g.addArc(i * W + j, i2 * W + j2, 1);
        }
      }
    }
  }
  cout << dijkstra(g, S).first[G] / 2 << endl;
}



Measured memory_bytes: 3264