For this Question: Rick has got a huge candy bag. The bag contains a total of O orange candies, A apple candies, and U candies with an unknown flavor (can be orange or apple as well). 
Now Morty wants to know the maximum number of candies that can be drawn from the bag blindfolded such that no more than X orange and Y apple candies are drawn out.

Can you solve the problem for Morty?The first line of the input contains three integers O, A, and U, representing the number of orange, apple, and unknown flavored candies respectively.
The second line of the input contains two integers X and Y representing the maximum number of orange and apple candies that can be drawn of the bag.

Constraints
0 <= O, A, U <= 10<sup>9</sup>
0 <= X, Y <= 10<sup>9</sup>Output a single integer, the maximum number of candies that can be drawn out of Rick's bag.Sample Input 1
4 2 7
2 7

Sample Output 1
2

Explanation: If we draw out more than 2 candies, there is a possible chance for 3 candies to be orange.

Sample Input 2
1 2 3
8 4

Sample Output 2
4, I have written this Solution Code: [o,a,u]=[int(i) for i in input().split()]
s=o+a+u
[x,y]=[int(i) for i in input().split()]
o+=u
a+=u
if o<=x and a<=y:
    print(s)
elif o<=x:
    print(y)
elif a<=y:
    print(x)
else:
    print(min(x,y)), In this Programming Language: Python, Now tell me if this Code is compilable or not?