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 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>

int mygetline(char s[], int size)
{
    int c, i;

    for ( i = 0;  (c = getchar()) != EOF && c != '\n' && i < size - 1; i++ ) {
        s[i] = c;
    }

    s[i] = '\0';

    if ( c == EOF && i == 0 ){
        return -1;
    }

    return i;
}

int main()
{
    char s[256],t[256],u[256];
    int a,b;

    mygetline(s,256); 
    mygetline(t,256);
    scanf("%d%*c",&a);
    scanf("%d%*c",&b);

    mygetline(u,256);

    int s_cnt=0,t_cnt=0;

    while (s[s_cnt]!=0) {
        s_cnt++;
    }
    while (t[t_cnt]!=0) {
        t_cnt++;
    }
    
    int i=0;
    while (s[i]==u[i]) {
        i++;
    }
    int j=0;
    while (t[j]==u[j]) {
        j++;
    }
    if (i==s_cnt) a-=1;
    if (j==t_cnt) b-=1;

    printf("%d %d",a,b);


    return 0;
}