Problem:
 Score : 100 points    Problem Statement  We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now.      Constraints   S , T , and U are strings consisting of lowercase English letters.  The lengths of S and T are each between 1 and 10 (inclusive).  S \not= T  S=U or T=U .  1 \leq A,B \leq 10  A and B are integers.         Input  Input is given from Standard Input in the following format:  S  T  A  B  U       Output  Print the answer, with space in between.        Sample Input 1 red blue
3 4
red      Sample Output 1 2 4  Takahashi chose a ball with red written on it and threw it away.
Now we have two balls with the string S and four balls with the string T .       Sample Input 2 red blue
5 5
blue      Sample Output 2 5 4  Takahashi chose a ball with blue written on it and threw it away.
Now we have five balls with the string S and four balls with the string T .

Solution (Python):
S,T=input().split()
A,B=(int(x) for x in input().split())
U=input()
if U == S:
    A=A-1
elif U == T:
    B=B-1
print(A," ",B)

Solution (Python):
s,t = input().split()
a,b = map(int,input().split())
u = input()
if u == s:
    a -= 1
else:
    b -= 1
print(a,b)

Solution (Python):
a, b = map(str, input().split())
c, d = map(int, input().split())

f = input()

if f == a:
  print(c-1, d)
else:
  print(c, d-1)

Solution (Python):
s, t = input().split()
a, b = map(int, input().split())
u = input()

if u == s:
    a -= 1
elif u == t:
    b -= 1

print(a, b)

Solution (Python):
s, t = input().split()
a, b = map(int, input().split())
u = input()




if u == s:
    print(a-1, b)
else:
    print(a, b-1)

Solution (Python):
s, t = map(str, input().split())
a, b = map(int, input().split())
u = input()

if u == s:
    print(a-1, b)
elif u == t:
    print(a, b-1)

Solution (Python):
S, T = input().split(' ')
A, B = map(int, input().split(' '))
U = input()

def main():
    balls = {
        S: A,
        T: B
    }

    balls[U] -= 1

    return print(balls[S], balls[T])

main()

Solution (Python):
S, T = input().split()
A, B = map(int, input().split())
U = input()
if S == U:
    A = A - 1
else:
    B = B - 1
print(A, B)

Solution (Python):


red,blue = map(str,input().split())
num1,num2 = map(int,input().split())
u = str(input())

if u==red:
    print(num1-1,num2)
elif u==blue:
        print(num1,num2-1)

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

S, T = input().split()
A, B = MAP()
U = input()
if U == S:
	print(A - 1, B)
if U == T:
	print(A, B - 1)

Solution (Python):
S, T = map(str, input().split())
A, B = map(int, input().split())
U = input()
if S == U:
    print(A-1, B)
elif T == U:
    print(A, B-1)
else:
    print(A, B)

Solution (Python):
s, t = [i for i in input().split(' ')]
a, b = [int(i) for i in input().split(' ')]
u = input()

if s == u:
  print(a-1, b)
else:
  print(a, b-1)

Solution (Python):
s,t=map(str,input().split())
a,b=map(int,input().split())
u=str(input())
if u==s:
    print(a-1, b)
else:
    print(a,b-1)

Solution (Python):
s,t=input().split()
a,b=map(int,input().split())
u=input()

if u==s:
	a=a-1
if u==t:
	b=b-1

print(a,b)

Solution (Python):


def solve():
    S, T = input().split()
    A, B = list(map(int, input().split()))
    U = input()

    if S == U:
        A -= 1
    else:
        B -= 1

    print(A, B)


if __name__ == "__main__":
    solve()

Solution (Python):
def main():
	
	
	S, T = list(map(str, input().split()))
	A, B = list(map(int, input().split()))
	U = input()
	
	if U == S:
		print(A-1, B)
	else:
		print(A, B-1)

if __name__ == '__main__':
    main()

Solution (Python):
s,t = input().split()
a,b = map(int,input().split())
u = input()
if u == s:
    print(a-1,b)
elif u == t:
    print(a,b-1)

Solution (Python):
s,t = list(input().split())
a,b = list(map(int,input().split()))
u = input()

if s == u:
    print(a-1,b)
elif t == u:
    print(a,b-1)
else:
    print(a,b)

Solution (Python):
def solve():
    S, T = input().split()
    A, B = map(int, input().split())
    U = input()
    if U == S: A -= 1
    elif U == T: B -= 1
    print(A, B)

solve()

Solution (Python):
S, T = input().split()
A, B = map(int, input().split())
U = input()

print('{} {}'.format(A - 1, B) if U == S else '{} {}'.format(A, B - 1))

Solution (Python):
st = input().split(' ');
s = st[0];
t = st[1];
ab = input().split(' ');
a = int(ab[0]);
b = int(ab[1]);
u = input().rstrip('\n');

if u == s :
	a = a-1;
else :
	b = b-1;

print(a,b);

Solution (Python):
s, t = input().split()
a, b = map(int, input().split())
u = input()

if s == u:
  print(a-1, b)
else:
  print(a, b-1)

Solution (Python):
red , blue = map(str,input().split())
a, b = map(int,input().split())
color = input()

if color == red:
  print((a-1), b)
else:
  print(a, (b-1))

Solution (Python):
ST = list(input().split())
A, B = map(int, input().split())
U = input()
if U == ST[0]:
    print(A-1,B)
else:
    print(A, B-1)

Solution (Python):
S, T = map(str, input().split())
A, B = map(int, input().split())
U = input()

if U == S:
    print(A - 1, B, sep=" ")
elif U == T:
    print(A, B - 1, sep=" ")

Solution (Python):
s,t = input().split()
a,b = map(int, input().split())
u=input()

if u==s:
  a-=1
else:
  b-=1

print(a,b)

Solution (Python):
a, b = input().split(" ")
a_count, b_count = list(map(int, input().split(" ")))
select = input()

if select == a:
  a_count -= 1
elif select == b:
  b_count -= 1
print(str(a_count) + " "+ str(b_count))

Solution (Python):
S, T = input().split()
A, B = map(int, input().split())
U = input()



if U == S:
    A-=1
elif U == T:
    B-=1
    
print(A, B)

Solution (Python):
s, t = input().split()
a, b = map(int, input().split())
u = input()
if u == s:
    a -= 1
elif u == t:
    b -= 1
print(a, b)

Solution (Python):
S,T = map(str, input().split())
A,B = map(int, input().split())
U = str(input())
if U == T:
    B-=1
else:
    A-=1
print(A, B)

Solution (Python):

S, T = input().split(" ")
A, B = map(int,input().split(" "))
U = input()

if S == U:
    print(A-1, B)
else:
    print(A, B-1)

Solution (Python):
s,t = map(str,input().split())
a,b = map(int,input().split())
u = str(input())
if u == s:
  print(a-1,b)
else:
  print(a,b-1)

Solution (Python):
s, t = input().split()
a, b = [int(i) for i in input().split()]
u = input()

if s == u:
    a -= 1
if t == u:
    b -= 1
    
answer = str(a) + ' ' + str(b)
print(answer)

Solution (Python):
x=list(input().split())
a,b=map(int,input().split())
y=input()
if y==x[0]:
    print(a-1,b)
else:
    print(a,b-1)

Solution (Python):
S, T = input().split()
A, B = map(int, input().split())
U = input()

if S == U:
    print(A - 1, end=' ')
    print(B)
elif T == U:
    print(A, end=' ')
    print(B - 1)
else:
    print(A, end=' ')
    print(B)

Solution (Python):
S, T = map(str,input().split()) 
A, B = map(int,input().split()) 
U = input() 

a = A
b = B

if U == S:
    a = a - 1
elif U == T:
    b = b - 1
    
print(a,b)

Solution (Python):
s, t = map(str, input().split())
a, b = map(int, input().split())
u = str(input())

if u == s:
    a -= 1
elif u == t:
    b -= 1
print(a, b)

Solution (Python):
S,T = list(input().split())
A,B = list(map(int, input().split()))
U = input()

if U == S:
    print('%d %d' %(A-1,B))
else:
    print('%d %d' %(A,B-1))

Solution (Python):


s, t = input().split()
a, b = map(int, input().split())
u = input()

if u == s:
    a -= 1
else:
    b -= 1
print(str(a) + ' ' + str(b))

Solution (Python):
s,t = input().split()
a,b = map(int, input().split())
u = input()

if u == s:
    print(str(a-1) + " " + str(b) )
else:
    print(str(a) + " " + str(b-1) )

Solution (Python):
s, t = input().split()
a, b = map(int, input().split())
u = input()

if s == u:
    a -= 1
elif t == u:
    b -= 1

print(a, b)

Solution (Python):
S,T = map(str,input().split())
A,B = map(int,input().split())
U = input()

if U==S:
    print(A-1,B)
else:
    print(A,B-1)

Solution (Python):



def main():
    s, t = input().split(" ")
    a, b = map(int, input().split(" "))
    u = input()
    if u == s:
        a -= 1
    elif u == t:
        b -= 1
    print("%d %d" % (a, b))


if __name__ == '__main__':
    main()

Solution (Python):
x = input().split()
y = input().split()
y = [int(l) for l in y]
U = input()

if U == x[0]:
  y[0] = y[0]-1
else:
  y[1] = y[1]-1

print(y[0],y[1])

Solution (Python):
S, T = list(input().split())
A, B = list(map(int,input().split()))
U = input()

if(U == S):
  print(A-1, B) 
else:
  print(A, B-1)

Solution (Python):
S,T=map(str,input().split())
A,B=map(int,input().split())
U=input()

if S==U:
    A-=1
elif T==U:
    B-=1
print(A,B)

Solution (Python):





def solv(S, T, A, B, U):
    if S == U:
        A -= 1
    elif T == U:
        B -= 1
    return A, B


if __name__ == "__main__":

    S, T = input().split()
    A, B = map(int, input().split())
    U = input()
    a1, a2 = solv(S, T, A, B, U)

    print(a1, a2)

Solution (Python):

string = input()
a, b = map(int, input().split())
splitted = string.split()
u = input()

if u == splitted[0]:
    print(' '.join([str(a-1), str(b)]))
else:
    print(' '.join([str(a), str(b-1)]))

Solution (Python):
S,T = input().split()
A,B = map(int, input().split())
N = input()

if N == S:
    A -= 1
else:
    B -= 1

print(A,B)

Solution (Python):
S,T=input().split()
A,B=map(int,input().split())
U=input()

if S==U:
  print(A-1,B)
else:
  print(A, B-1)

Solution (Python):
S, T = map(str, input().split())
A, B = map(int, input().split())
U = str(input())
if U == S:
  A-=1
elif U == T:
  B-=1
print(A,B)

Solution (Python):
s, t = map(str, input().split())
a, b = map(int, input().split())
if input() == s:
    print (a-1,b)
else:
    print (a,b-1)

Solution (Python):
s,t = input().split()
a,b = map(int,input().split())
u = input()
if u == s:
  print(a-1,b)
else:
  print(a,b-1)

Solution (Python):
s,t=input().split()
x,y=map(int,input().split())
if s==input():
    print(x-1,y)
else:
    print(x,y-1)

Solution (Python):
def main():
    s,t = map(str,input().split())
    a,b = map(int,input().split())
    u = input()
    if s == u:
        a -= 1
    elif t == u:
        b -= 1

    print(a,b)

main()

Solution (Python):
S, T = map(str,input().split())
A, B = map(int,input().split())
U = input()

if U == S:
    A = A - 1

if U == T:
    B = B - 1


print(str(A) + ' ' + str(B))

Solution (Python):
c1, c2 = input().split()
a, b = map(int, input().split())
u = input()

if c1 == u:
    a = a - 1
else:
    b = b - 1

print(a, b)

Solution (Python):
import sys
s,t=(str(i) for i in input().split())
a,b=(int(i) for i in input().split())
u = input()

if u == s:
    a=a-1

else :
    b = b-1

print(a,b)

Solution (Python):
import numpy as np

ST=np.array(input().split(" "))
S=ST[0]
T=ST[1]
AB=np.array(input().split(" "),dtype=np.int32)
A=AB[0]
B=AB[1]
U=input()

if(S==U):
    A=A-1
elif(T==U):
    B=B-1

result="{} {}".format(A,B)
print(result)

Solution (Python):
S, T = input().split()
A, B = map(int, input().split())
U = input()

if U == S:
    print(A-1, B)

elif U == T:
    print(A, B-1)

Solution (Python):
s, t = map(str, input().split())
a, b = map(int, input().split())
u = str(input())
if s == u:
  print(a-1, b)
else:
  print(a, b-1)

Solution (Python):
S, T=input().split()
A,B = map(int,input().split())
I = input()
D = {}
D[S] = A
D[T] = B
D[I] =D[I] - 1
print(D[S],D[T])

Solution (Python):
s,t = [i for i in input().split()]
a,b = [int(e) for e in input().split()]
u = input()
if s == u:
    print(str(a-1) + ' ' + str(b))
else:
    print(str(a) + ' ' + str(b-1))

Solution (Python):
S, T = input().split()
A, B = map(int, input().split())
U = input()

if U == S:
    A -= 1
if U == T:
    B -= 1

print(A, B)

Solution (Python):
S,T=map(str, input().split())
A,B=map(int, input().split())
U=input()

if U==S:
    print(A-1,B)
else:
    print(A,B-1)

Solution (Python):
S, T = input().split()
A, B = list(map(int, input().split()))
U = input()
if U == S:
    A = A - 1
    print(A , B)
else:
    B = B - 1
    print(A , B)

Solution (Python):
s,t = input().split()
a,b = map(int,input().split())
u = input()

if u == s:
  a = a-1
if u == t:
  b = b-1
print(a,b)

Solution (Python):
S, T = map(str, input().split())
A, B = map(int, input().split())
U = input()

if U == S:
  print(str(A-1), str(B))
elif U == T:
  print(str(A), str(B-1))
else:
  print(str(A), str(B))

Solution (Python):
def main(sample_file = ''):

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):   
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    
    
    
    
    

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    
        
        
            
            
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    
    if sample_file:
        sys.stdin = open(sample_file)
        
    
    

    S, T = R_str()
    A, B = R()
    U = r()
    if S == U:
        print(A-1,B)
    else:
        print(A, B-1)
    


    
    
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Solution (Python):
s,t = input().split()
a,b = map(int, input().split())
u = input()

if s==u:
  print(a-1, b)
else:
  print(a, b-1)

Solution (Python):
s, t = list(map(str, input().split()))
a, b = list(map(int, input().split()))
u = input()

if s == u:
  print(a - 1, b)
if t == u:
  print(a, b - 1)

Solution (Python):
S, T = map(str, input().split())
A, B = map(int, input().split())
U = str(input())

if(S == U):
  A-=1
else:
  B-=1
print(A, B)

Solution (Python):
s,t = input().split()
a, b = map(int, input().split())
u = input()

if s == u:
  a = a - 1
else:
  b = b - 1 
  
print(str(a) + ' ' + str(b))

Solution (Python):
S, T = input().split()
A, B = map(int, input().split())
U = input()
if S == U:
    print(A - 1, B, sep=" ")
else:
    print(A, B-1, sep=" ")

Solution (Python):
S, T = map(str, input().split())
A, B = map(int, input().split())
U = input()

if U == S:
    A -= 1
else:
    B -= 1

print(A, B)

Solution (Python):
str1, str2 = input().split()
cnt1, cnt2 = list(map(int, input().split()))
tar = input()

if tar == str1:
  cnt1 -= 1
else:
  cnt2 -= 1

print(str(cnt1) + " " + str(cnt2))

Solution (Python):
s,t = list(input().split())
a,b = list(map(int, input().split()))
u = input()

if u == s:
    print('{} {}'.format(a-1,b))
else:
    print('{} {}'.format(a,b-1))

Solution (Python):
s, k = input().split(' ')
sn, kn = map(int, input().split(' '))
u = input()

if s == u:
    print(sn - 1, kn)
else:
    print(sn, kn - 1)

Solution (Python):
s, t = input().split()
a, b = map(int,input().split())
u = input()
if s == u:
  a = a-1
elif t == u:
  b = b-1
print("{} {}".format(a,b))

Solution (Python):
(A,B)=map(str,input().split())
(Anum,Bnum)=map(int,input().split())
moji=input()

if moji==A:
    print(str(Anum-1)+' '+str(Bnum))
else:
    print(str(Anum)+' '+str(Bnum-1))

Solution (Python):
s,t = input().split()
a,b = map(int, input().split())
u = input()
 
if s == u:
  print(a-1,b)
else:
  print(a,b-1)

Solution (Python):

S, T = map(str, input().split())
A, B = map(int, input().split())
U = str(input())
if U == S:
    A = A - 1
elif U == T:
    B = B - 1
print(A, B)

Solution (Python):
s,t = input().split()
a,b = map(lambda x: int(x) ,input().split())
u = input()

if u == s :
    a -= 1
elif u == t :
    b -= 1

print(a,b)

Solution (Python):
s,t = map(str,input().split())
a,b = map(int,input().split())
u=str(input())

if s == u:
    a=a-1
else:
    b=b-1

print(a,b)

Solution (Python):
'''
.append(要素) リストに要素を追加 
.extend(リスト) リストを連結する
.insert(場所,要素) 指定した場所に要素追加
del 配列名[場所]
-1で末尾で末尾から一つ前

sort()
sorted(reverse=true)

配列の初期化
配列名=[a]*n+[b]*m

Decimal()
'''

from sys import stdin
from itertools import accumulate, dropwhile, takewhile, groupby
import bisect
import copy
import math
import itertools
from functools import reduce
from operator import mul


color = stdin.readline().rstrip().split()
nums = [int(s) for s in stdin.readline().rstrip().split()]
tar = stdin.readline().rstrip()
for el in range(2):
    if color[el] == tar:
        nums[el] -= 1
res = [str(s) for s in nums]
print(' '.join(res))

Solution (Python):
s, t = input().split()
a, b = map(int,input().split())
u = input()
if u == s:
    print(a-1,b)
else:
    print(a,b-1)

Solution (Python):
s, t = input().split()
a, b = list(map(int, input().split()))
u = input()

if u == s:
    a -= 1
elif u == t:
    b -= 1
print(a, b)

Solution (Python):
S,T = input().split()
A,B = map(int,input().split())
U = input()
if U == S:
  A -= 1
elif U == T:
  B -= 1
print(A,B)

Solution (Python):
s, t = map(str, input().split())
a, b = map(int, input().split())
u = input()

if u == s:
  a = a-1
else:
  b = b-1
print(a, b)

Solution (Python):
def solve():
  S,T = input().split()
  A,B = map(int, input().split())
  dic = {S:A, T:B}
  U = input()
  dic[U] -= 1
  print('{0} {1}'.format(dic[S],dic[T]))
  
solve()

Solution (Python):
s ,t= [x for x in input().split()]
A , B = [int(x) for x in input().split()]
U = input()
if s != t:
    if U == t :
        B -=1
    if U == s:
        A-= 1
print('{} {}'.format(A,B))

Solution (Python):
S, T = input().split()
A, B = map(int,input().split())
U = input()






if U == S:
    print(A-1, B)
else:
    print(A,B-1)

Solution (Python):

S, T = map(str, input().split())
A, B = map(int, input().split())

U = str(input())

if S == U:
    A = A-1

if T == U:
    B = B-1


print("{} {}".format(A, B))

Solution (Python):
a,b = input().split()
c,d = list(map(int, input().split()))
s = input()
if(a==s):
  print(c-1,d)
else:
  print(c,d-1)

Solution (Python):
def main():
	s,t = map(str,input().split())
	a, b = map(int, input().split())
	u= input()
	if u==s:
		print(str(a-1),str(b))
	else:
		print(str(a),str(b-1))
main()

Solution (Python):
s = list(input().split())
a = list(map(int, input().split()))
t = input()
a[s.index(t)] -= 1
print(*a)

Solution (Python):
def main():
    s, t = map(str, input().split())
    a, b = map(int, input().split())
    u = input()
    if s == u:
        a -= 1
    if t == u:
        b -= 1
    print(str(a) + ' ' + str(b))


main()

Solution (Python):
S, T = input().split(" ")
A, B = [int(i) for i in input().split(" ")]
U = input()

if S==U :
  print("{} {}".format(A-1,B))
else:
  print("{} {}".format(A,B-1))

Solution (Python):
s,t=map(str, input().split()) 
a,b=map(int, input().split()) 
u=str(input()) 

if u ==s:
    print(str(a-1)+" "+str(b))
else:
    print(str(a) +' '+ str(b-1))

Solution (Python):
S , T = input().strip().split(" ") ;
A , B = map ( int , input().strip().split(" " ) ) ;
U = input().strip() ;

if U == S :
	A -=1 ; 
elif U == T : 
	B -= 1 ; 
print ( "{0} {1}".format( A , B ) ) ;

Solution (Python):
s, t = (i for i in input().split())
a, b = (int(i) for i in input().split())
u = input()

if(s == u):
    print(a-1, b)
else:
    print(a, b-1)

Solution (Python):
S, T = map(str, input().split())
A, B = map(int, input().split())
U = input()

if U == S:
  A -= 1

if U == T:
  B -= 1

print(A, B)

Solution (Python):
S, T = input().split()
A, B = map(int, input().split())
U = input()

if (S == U):
  print(str(A-1) + ' ' + str(B))
else:
  print(str(A) + ' ' + str(B-1))

Solution (Python):
S, T = input().split()
A, B = map(int, input().split())
U = input()

if U == S:
    A -= 1
else:
    B -= 1

print(A, B)