import std.stdio, std.conv, std.functional, std.string; import std.algorithm, std.array, std.container, std.range, std.typecons; import std.numeric, std.math, std.random; import core.bitop; string FMT_F = "%.10f"; static string[] s_rd; T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; } string RDR()() { return readln.chomp; } T[] ARR(T = long)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; } T[] RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; } T[][] RDA2(T = long)(size_t n, T[] fix = []) { auto r = new T[][](n); foreach (i; 0..n) { r[i] = readln.chomp.split.to!(T[]); foreach (j, e; fix) r[i][j] += e; } return r; } size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;} size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; } bool inside(T)(T x, T b, T e) { return x >= b && x < e; } long lcm(long x, long y) { return x * y / gcd(x, y); } long mod = 10^^9 + 7; //long mod = 998244353; //long mod = 1_000_003; void moda(ref long x, long y) { x = (x + y) % mod; } void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; } void modm(ref long x, long y) { x = (x * y) % mod; } void main() { auto x = RD; auto y = RD; auto z = RD; auto S0 = RD!char; auto t0 = RD; auto S1 = RD!char; auto t1 = RD; long ans; if (S0 == S1) { ans = abs(t1 - t0); } /*else if (S0 == 'B') { auto len = S1 == 'A' ? x : z; ans = min(t0 + t1 - 1, (y - t0) + (len - t1) + 1); } else if (S1 == 'B') { auto len = S0 == 'A' ? x : z; ans = min(t1 + t0 - 1, (y - t1) + (len - t0) + 1); }*/ else { long len0, len1, mid; if (S0 == 'A') { len0 = x; if (S1 == 'B') { len1 = y; mid = z; } else { len1 = z; mid = y; } } else if (S0 == 'B') { len0 = y; if (S1 == 'A') { len1 = x; mid = z; } else { len1 = z; mid = x; } } else { len0 = z; if (S1 == 'A') { len1 = x; mid = y; } else { len1 = y; mid = x; } } auto ans0 = min(t0 + t1 - 1, (len0 - t0) + (len1 - t1) + 1); auto ans1 = min(t0 + mid + (len1 - t1), (len0 - t0) + mid + t1); ans = min(ans0, ans1); } writeln(ans); stdout.flush(); debug readln(); }