Find the highest value with the given constraints (Python) :     c = [416,585,464]
    
    A0 = [100,50,200]
    A1 = [100,100,200]
    A2 = [100,150,100]
    A3 = [100,200,0]
    A4 = [100,250,0]
    
    b = [300,300,300,300,300]
    
    for num in A0,A1,A2,A3,A4:
        t0 = num[0]*1 + num[1]*1 + num[2]*1
        t1 = num[0]*0 + num[1]*1 + num[2]*0
        t2 = num[0]*0 + num[1]*0 + num[2]*0
        t3 = num[0]*0 + num[1]*0 + num[2]*1
        t4 = num[0]*1 + num[1]*0 + num[2]*0
        t5 = num[0]*0 + num[1]*1 + num[2]*1
        t6 = num[0]*1 + num[1]*1 + num[2]*0
        t7 = num[0]*1 + num[1]*0 + num[2]*1

Now check each of the value in t0 against each of its corresponding value in the "b" array. If any of the values from t0 is greater than 300, then t0 is discarded. If not, then the nultiplied values to that t_ should be multiplied
with each corresponding "c" array value, and after that determine the highest value and print it. For ex: t1 has 50,100,150,200,250, all of which are equal to or below 300, so we take 0*c[0]+1*c[1]+0*c[2], which gives us 585. However, that isn't the highest value. The highest value is 1049, which is acquired by t5. It has 250,300,250,200,250. Taking 0*c[0]+1*c[1]+1*c[2]=1049

I am stuck here.