#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;

int main(){
    ll x,y,z;
    cin>>x>>y>>z;
    string s[2];
    ll a[2];
    rep(i,2)cin>>s[i]>>a[i];
    ll b[2];
    rep(i,2){
        if(s[i]=="A")b[i]=x-a[i];
        if(s[i]=="B")b[i]=y-a[i];
        if(s[i]=="C")b[i]=z-a[i];
    }
    ll ans = longinf;
    if(s[0]==s[1]){
        ans=min(ans,abs(a[1]-a[0]));
    }
    ans = min(ans,a[0]+a[1]-1);
    ans = min(ans,b[0]+b[1]+1);
    ans = min(ans,a[0]+b[1]+min({x,y,z}));
    ans = min(ans,a[1]+b[0]+min({x,y,z}));
    cout<<ans<<endl;
    return 0;
}