#include <bits/stdc++.h>


using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0; i<int(n); i++)
#define FOR(i,m,n) for(int i=int(m); i<int(n); i++)
#define ALL(obj) (obj).begin(),(obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL vector<vector<long long>>
#define VC vector<char>
#define VS vector<string>
#define VVC vector<vector<char>>
#define VB vector<bool>
#define VVB vector<vector<bool>>
#define fore(i,a) for(auto &i:a)

typedef pair <int, int> P;
template<class T> bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }
const int  INF = 1 << 30;
const ll INFL = 1LL << 60;
const ll mod = 1000000007;



int main() {

	ll x, y, z;
	cin >> x >> y >> z;

	char sa, sb;
	ll ta, tb;
	cin >> sa >> ta >> sb >> tb;

	if (sa == sb) {
		ll ans = abs(tb - ta);
		if (tb < ta)swap(ta, tb);
		if (sa == 'A') {
			ans = min(ans, y + ta - tb + x);
			ans = min(ans, z + ta - tb + x);
		}
		else if (sa == 'B') {
			ans = min(ans, x + ta - tb + y);
			ans = min(ans, z + ta - tb + y);
		}
		else if (sa == 'C') {
			ans = min(ans, x + ta - tb + z);
			ans = min(ans, y + ta - tb + z);
		}
		cout << ans << endl;
		return 0;
	}

	ll a, b, c, d;

	a = ta;
	b = tb;
	if (sa == 'A')c = x - ta;
	if (sa == 'B')c = y - ta;
	if (sa == 'C')c = z - ta;
	if (sb == 'A')d = x - tb;
	if (sb == 'B')d = y - tb;
	if (sb == 'C')d = z - tb;

	if (sa != 'A'&&sb != 'A') {
		ll ans = min({ a + b - 1,c + d + 1,x + a + d,x + b + c });
		cout << ans << endl;
		return 0;
	}
	if (sa != 'B'&&sb != 'B') {
		ll ans = min({ a + b - 1,c + d + 1,y + a + d,y + b + c });
		cout << ans << endl;
		return 0;
	}
	if (sa != 'C'&&sb != 'C') {
		ll ans = min({ a + b - 1,c + d + 1,z + a + d,z + b + c });
		cout << ans << endl;
		return 0;
	}
	

	


}