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 Java8 (OpenJDK 1.8.0) (judge verdict: Runtime Error)

import java.util.*;

public class Main {
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int k = sc.nextInt();
        int[] a = new int[n];

        Map<Integer, Double> map = new HashMap<>();
        for (int i = 0;i<n; i++) {
            a[i] = sc.nextInt();
            map.put(i, (double)(a[i] * (a[i] + 1)) / (2 * a[i]));
        }
        double max = 0;
        double first = 0;
        for (int i = 0;i<k ;i++) {
          first += map.get(i);
        }
   
        int l = 0;
        double tmp = first;
        for (int i = k;i<n;i++) {
          tmp += map.get(i);
          tmp -= map.get(l++);
          System.out.println(tmp);
		  max = Math.max(tmp, max);
        }
        System.out.println(max);
    }
}