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 Rust (1.15.1) (judge verdict: Runtime Error)

use std::io::{stdin, stdout, Write};
use std::collections::HashMap;

fn main() {
    let out = stdout();
    let mut out = out.lock();
    let mut first_line = String::new();
    stdin().read_line(&mut first_line).unwrap();
    let n: usize = first_line.trim().parse().unwrap();

    let mut second_line = String::new();
    stdin().read_line(&mut second_line).unwrap();
    let v: Vec<&str> = second_line.split_whitespace().collect();
    let mut map =HashMap::new();
    for i in 0..n {

        if map.contains_key(v[i]) {
            write!(out, "NO").unwrap();
            return;
        }
        map.insert(v[i], "");
    }
    write!(out, "YES").unwrap();
}