Example $2$:

Input:

$M=10$

$B=\{15,5,2\}$

$A=\{6,4,1\}$

Output: $10$

Explanation:

It is optimal not to buy any coins in Bangalore.

Your Task: You have to complete the function MaxMorhev$()$ which takes

integer $M($initial money$),$ array $B$ of length $3$ represents the cost rate of

coins in Bangalore and array $A$ of length $3$ represents the cost rate in

Ahmedabad as input parameters and return maximum money you can

have in Ahmedabad after the transaction of at most one type coins.

Constraints:

$1M{10}^5$

$1A[i],B[i]{10}^4$

ditser function femplate for python?

class solutions

$1*$ det Maxmoney $(5,11,M,11,)$

$($ coins$-1$ sit $(sip(ii,A))$

$89=$

$1$

$111213$

$1314$

max money $0$ for price ba

num coins $\frac{M}{\frac{?}{?}}$ price batemabad in coma

If num coins? br

money ahemadabad num coins"rate ahe

max money max $($max money, money ahen.

ruturn max money

$151$

tail I Driver code Ind