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>
#include<stdlib.h>
int mycomp(const void* pt, const void* pt1);
int main()
{
	long int ar[200001] = { 0 };
	long int n;
	scanf("%ld", &n);
	for (int i = 1; i <= n; i++) {
		scanf("%ld", &ar[i]);
	}
	qsort(ar + 1, n, sizeof(long int), mycomp);
	for (int i = 1; i < n; i++) {
		if (ar[i] == ar[i + 1]) {
			printf("NO"); return;
		}
	}
	printf("YES");
}
int mycomp(const void* pt, const void* pt1)
{
	const long int* st = (const long int*)pt;
	const long int* st1 = (const long int*)pt1;
	return *st - *st1;
}