def findLowestPrice$($products$,$ discounts$)$:

total $=0$

for test$\_$case in range$($len$($products$))$:

min$\_$price $=$ float$(\text{'}$inf$\text{'})$

for i in products$[$test$\_$case$]$:

price $=$ int$($i$[0])$

prices $=[]$

for j in range$(1,$ len$($i$))$:

val $=0$

if i$[$j$]==$ 'EMPTY':

val $=$ price

else:

for k in discounts$[$test$\_$case$]$:

if k$[0]==$ i$[$j$]$:

a$,$ b $=$ int$($k$[1]),$ int$($k$[2])$

break

if a $==0$:

val $=$ b

elif a $==1$:

val $=$ round$($price $-($price $*($b $/100)))$

elif a $==2$:

val $=$ price $-$ b

prices.append$($val$)$

min$\_$price $=$ min$($min$\_$price, sum$($prices$))$

total $+=$ min$\_$price

return total

fix this code