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 Prpgram
{
    static void Main(string[] args)
    {
        string color = Console.ReadLine();
        string boru = Console.ReadLine();
        string away = Console.ReadLine();

        string[] colorlist = color.Split(' ');
        //string S = colorlist[0];
        //string T = colorlist[1];

        string[] borulist = boru.Split(' ');
        int A = int.Parse(borulist[0]);
        int B = int.Parse(borulist[1]);

        if (colorlist[0] == away) A--;
        else B--;

        Console.Write(A + " " + B);

    }
}