#include<iostream> #include<string> #include<cstdio> #include<vector> #include<cmath> #include<algorithm> #include<functional> #include<iomanip> #include<queue> #include<ciso646> #include<random> #include<map> #include<set> #include<bitset> #include<stack> #include<unordered_map> #include<utility> #include<cassert> using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; const ll mod = 998244353; const ll INF = mod * mod; typedef pair<int, int> P; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i<n;i++) #define per(i,n) for(int i=n-1;i>=0;i--) #define Rep(i,sta,n) for(int i=sta;i<n;i++) #define rep1(i,n) for(int i=1;i<=n;i++) #define per1(i,n) for(int i=n;i>=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) typedef pair<ll, ll> LP; typedef vector<int> vec; typedef vector<string> svec; typedef long double ld; typedef pair<ld, ld> LDP; const ld eps = 1e-8; void solve() { ll l[3]; ll mi = INF; rep(i, 3) { cin >> l[i]; mi = min(mi, l[i]); } char s, t; ll a, b; cin >> s >> a >> t >> b; int si = s - 'A', ti = t - 'A'; ll ans = INF; if (s == t) { ans = min(ans, abs(a - b)); } //l,l ans = min(ans, a + b - 1); //r,r ans = min(ans, l[si] + 1 - a + l[ti] + 1 - b-1); //l,r ans = min(ans, a + mi + l[ti] - b); //r,l ans = min(ans, l[si] - a + mi + b); cout << ans << endl; } signed main() { ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(10); //init(); solve(); //cout << "finish" << endl; //stop return 0; }