// yukicoder 859 路線A、路線B、路線C
// 2019.8.10 bal4u

#include <stdio.h>

typedef long long ll;

inline static ll MIN(ll a, ll b) { return a <= b? a: b; }

ll solve0(int s, int t, int *w) {
	ll a = MIN(w[1], w[2]);
	if (s < t) return MIN(t-s, s+w[0]-t + a);
	return MIN(s-t, t+w[0]-s + a);
}
	
ll solve1(int s, int t, int *w) {
	ll a, ans = s+t-1;
	if ((a = (ll)w[0]-s + w[1]-t + 1) < ans) ans = a;
	if ((a = (ll)s + w[1]-t + w[2]) < ans) ans = a;
	if ((a = (ll)w[0]-s + w[2] + t) < ans) ans = a;
	return ans;
}
	
char f[3];
int main()
{
	int i, j, w[3], t[2], a[3];
	char s[2][5];
	
	for (i = 0; i < 3; i++) scanf("%d", w+i);
	for (i = 0; i < 2; i++) {
		scanf("%s%d", s[i], t+i);
		f[s[i][0]-'A'] |= 1 << i;
	}
	for (i = 0; i < 3; i++) {
		if (f[i] == 3) {
			a[0] = w[i], a[1] = w[(i+1)%3], a[2] = w[(i+2)%3];
			printf("%lld\n", solve0(t[0], t[1], a));
			return 0;
		}
		if (f[i] == 1) for (j = 0; j < 3; j++) if (f[j] == 2) {
			a[0] = w[i], a[1] = w[j], a[2] = !f[0]? w[0]:(!f[1]? w[1]: w[2]);
			printf("%lld\n", solve1(t[0], t[1], a));
			return 0;
		}
	}
	return 0;
}