In a bag, there are balls of different colors. You can draw several balls blindly from the bag. What is the maximum number of balls z_1 you can draw such that it is guaranteed that balls of k_1 colors are absent among them? Also, determine the maximum number z_2 of balls you can draw such that balls of k_2 colors may be absent among them.
The first line contains the integers (3 \leq n \leq 10), k_1, k_2, where 0 < k_1, k_2 < n. The second line provides the quantities of balls for each color, with each quantity ranging from one to 20 inclusive.
Output the values z_1, z_2 on one line.
Example 1