#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

template< typename T >
struct edge {
  int src, to;
  T cost;

  edge(int to, T cost) : src(-1), to(to), cost(cost) {}

  edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

  edge &operator=(const int &x) {
    to = x;
    return *this;
  }

  operator int() const { return to; }
};

template< typename T >
using Edges = vector< edge< T > >;
template< typename T >
using WeightedGraph = vector< Edges< T > >;
using UnWeightedGraph = vector< vector< int > >;
template< typename T >
using Matrix = vector< vector< T > >;

template< typename T >
vector< T > dijkstra(WeightedGraph< T > &g, int s) {
  const auto INF = numeric_limits< T >::max();
  vector< T > dist(g.size(), INF);

  using Pi = pair< T, int >;
  priority_queue< Pi, vector< Pi >, greater< Pi > > que;
  dist[s] = 0;
  que.emplace(dist[s], s);
  while(!que.empty()) {
    T cost;
    int idx;
    tie(cost, idx) = que.top();
    que.pop();
    if(dist[idx] < cost) continue;
    for(auto &e : g[idx]) {
      auto next_cost = cost + e.cost;
      if(dist[e.to] <= next_cost) continue;
      dist[e.to] = next_cost;
      que.emplace(dist[e.to], e.to);
    }
  }
  return dist;
}


int main() {
  int64 X, Y, Z;
  cin >> X >> Y >> Z;
  char S1, S2;
  int64 T1, T2;
  cin >> S1 >> T1 >> S2 >> T2;
  WeightedGraph< int64 > g(101010);
  g['A' * 26].emplace_back('B' * 26, 1);
  g['B' * 26].emplace_back('A' * 26, 1);
  g['A' * 26].emplace_back('C' * 26, 1);
  g['C' * 26].emplace_back('A' * 26, 1);
  g['B' * 26].emplace_back('C' * 26, 1);
  g['C' * 26].emplace_back('B' * 26, 1);


  g['A' * 26 + 1].emplace_back('B' * 26 + 1, 1);
  g['B' * 26 + 1].emplace_back('A' * 26 + 1, 1);
  g['A' * 26 + 1].emplace_back('C' * 26 + 1, 1);
  g['C' * 26 + 1].emplace_back('A' * 26 + 1, 1);
  g['B' * 26 + 1].emplace_back('C' * 26 + 1, 1);
  g['C' * 26 + 1].emplace_back('B' * 26 + 1, 1);

  g['A' * 26].emplace_back('A' * 26 + 1, X - 1);
  g['B' * 26].emplace_back('B' * 26 + 1, Y - 1);
  g['C' * 26].emplace_back('C' * 26 + 1, Z - 1);


  g['A' * 26 + 1].emplace_back('A' * 26, X - 1);
  g['B' * 26 + 1].emplace_back('B' * 26, Y - 1);
  g['C' * 26 + 1].emplace_back('C' * 26, Z - 1);


  int x = 101010 - 1, y = x - 1;

  g[x].emplace_back(S1 * 26, T1 - 1);
  g[x].emplace_back(S1 * 26 + 1, (S1 == 'A' ? X : S1 == 'B' ? Y : Z) - T1);

  g[S2 * 26].emplace_back(y, T2 - 1);
  g[S2 * 26 + 1].emplace_back(y, (S2 == 'A' ? X : S2 == 'B' ? Y : Z) - T2);

  int64 ret = infll;
  if(S1 == S2) {
    chmin(ret, llabs(T1 - T2));
  }
  cout << min(ret, dijkstra(g, x)[y]) << endl;
}