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 in C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;

class RemainBall
{
    static void Main(string[] args)
    {
        
        var input = Console.ReadLine().Split(' ');
        string[] color = new string[2];
        color[0] = input[0];
        color[1] = input[1];
        int[] number = new int[2];
        var n = Console.ReadLine().Split(' ');
       for(var i = 0; i< 2; i++)
        {
            number[i] = int.Parse(n[i]);
        }
        var check = Console.ReadLine();
        int check_number = 0;
        for(var i = 0;i< 2;i++)
        {
            if(check == color[i])
            {
                check_number = i;
            }
        }
        number[check_number]--;

        Console.WriteLine("{0} {1}",number[0],number[1]);
    }
}