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 (Clang 3.8.0) (judge verdict: Accepted)

#include <stdio.h>
#define NUMBER 100
int main(void)
{
    int a,b;
    char x[NUMBER];
    char y[NUMBER];
    char z[NUMBER];
    int i;
    
    scanf("%s %s",x,y);
    scanf("%d %d",&a,&b);
    scanf("%s",z);
    
    for (i = 0;z[i] != EOF;i++){
        if (z[i] != x[i]){
            b = b - 1;
            break;
        }
        else if (z[i] != y[i]){
            a = a - 1;
            break;
        }
    }
    
    printf("%d %d\n",a,b);
    return 0;
}