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>
#include <string.h>
#include <limits.h>
#include <stdlib.h>
#include <math.h>

int main(void)
{
	long int i, j;
	long int a, b;
	long int count = 0;
	char s[20], t[20], u[20];
	
	scanf("%s %s %ld %ld %s", s, t, &a, &b, u);
	
	if(strlen(s) == strlen(t) ) {
		for(i = 0; i < strlen(s); i++) {
			if(s[i] != u[i]) {
				printf("%ld %ld\n", a, b - 1);
				return 0;
			}
		}
		printf("%ld %ld\n", a - 1, b);
		return 0;
	} else {
		if(strlen(s) == strlen(u) ) {
			printf("%ld %ld\n", a - 1, b);
		} else {
			printf("%ld %ld\n", a, b - 1);
		}
	}
	
	return 0;
}