#include <bits/stdc++.h>

int main()
{
	int64_t x[3];
	for (int i{}; i < 3; i++) scanf("%lld", x + i);
	using vpi = std::vector<std::pair<int, int64_t>>;
	using vvpi = std::vector<vpi>;
	vvpi edges(8);
	for (int i{}; i < 3; i++)
		for (int j{}; j < 2; j++)
		{
			int diff{(i + j) % 3};
			edges[1 + i].push_back({1 + diff, 1ll});
			edges[4 + i].push_back({4 + diff, 1ll});
		}
	
	for (int i{1}; i <= 3; i++)
	{
		edges[i].push_back({i + 3, x[i] - 1});
		edges[i + 3].push_back({i, x[i] - 1});
	}
	char S[2];
	int64_t index[2];
	for (int i{}; i < 2; i++)
		scanf(" %c%lld", S + i, index + i);
	edges[0].push_back({1 + S[0] - 'A', index[0] - 1});
	edges[0].push_back({4 + S[0] - 'A', x[S[0] - 'A'] - index[0]});
	edges[1 + S[1] - 'A'].push_back({7, index[1] - 1});
	edges[4 + S[1] - 'A'].push_back({7, x[S[1] - 'A'] - index[1]});

	using P = std::pair<int64_t, int>;
	std::priority_queue<P, std::vector<P>, std::greater<P>> dij;
	std::vector<int64_t> dist(8, 1ll << 60);
	dij.push({0, 0});
	dist[0] = 0;
	while (!dij.empty())
	{
		auto now{dij.top()};
		dij.pop();
		if (now.first > dist[now.second]) continue;
		for (auto& e: edges[now.second])
		{
			P next{now.first + e.second, e.first};
			if (next.first >= dist[next.second]) continue;
			dist[next.second] = next.first;
			dij.push(next);
		}
	}
	printf("%lld\n", dist[7]);

	return 0;
}