#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    vector<ll> nums(3);
    for(int i = 0; i < 3; ++i)  cin >> nums[i];
    char ch, ch2;
    ll s, t;
    cin >> ch >> s >> ch2 >> t;
    if(ch == ch2){
        if(ch == 'B')   swap(nums[0], nums[1]);
        else if(ch == 'C')  swap(nums[0], nums[2]);
    }
    else if(ch == 'A' && ch2 == 'B'){
        swap(nums[1], nums[2]);
    }
    else if(ch == 'B' && ch2 == 'A'){
        swap(nums[0], nums[1]);
        swap(nums[1], nums[2]);
    }
    else if(ch == 'B' && ch2 == 'C'){
        swap(nums[0], nums[1]);
    }
    else if(ch == 'C' && ch2 == 'A'){
        swap(nums[0], nums[2]);
    }
    else if(ch == 'C' && ch2 == 'B'){
        swap(nums[0], nums[2]);
        swap(nums[1], nums[2]);
    }

    ll ans = 1e+15;
    if(ch == ch2){
        chmin(ans, abs(s - t));
        chmin(ans, s - 1 + min(nums[1], nums[2]) + nums[0] - t + 1);
        chmin(ans, nums[0] - s + min(nums[1], nums[2]) + t);
    }
    else{
        chmin(ans, min(s - 1 + t, nums[0] - s + nums[2] - t + 1));
        chmin(ans, s - 1 + nums[1] + nums[2] - t + 1);
        chmin(ans, nums[0] - s + nums[1] + t);
    }
    cout << ans << '\n';
    
    return 0;
}