How fast is my Hot Wheels car? Several years back, Hot Wheels made a simple flash game called "Formula Fuelers Racers"*.  To play the game, you select three ingredients from a fridge to put into your car, which is then raced against the computer's randomly-generated car.  It turns out the mechanics of this game are pretty simple.  First off, the actual race "time" of your car is randomly generated and has no bearing on whether or not you win the race.  Secondly, the winner of the race is determined by a score which is calculated from the selected ingredients (duplicate ingredients are allowed, and the order matters).  Each ingredient has an associated "value" and an associated "operation" as shown in the following table:

#   ingredient     val  op
1   Hot Salsa       2   +
2   Root Beer       1   +
3   Milk            1   +
4   Pickle Juice    2   +
5   Mystery Lunch   -3  *
6   BBQ Sauce       2   +
7   Egg             1   +
8   Ketchup         2   +
9   Mustard         -1  *
10  Melon           1   +
11  Chocolate Milk  1   +
12  Mayonnaise      -2  *
13  Baby Food       0   +
14  Pepper          1   +
15  Salt            2   +
16  Syrup           -1  *
17  Salad Dressing  2   +
18  Orange Juice    1   +
19  Soy Sauce       2   +


For convenience, this challenge will be referring to ingredients by their number and not their name.  Here are the steps to compute a score:


First, initialize the score with the value of the first ingredient.
Then, use the second ingredient's operation to combine the current score and the second ingredient's value to get an updated score.
Finally, use the third ingredient's operation to combine the current score and the third ingredient's value to get the final score.


Higher scores are better and always beat lower scores.

For example, the ingredients 1 2 3 have a score of (2+1)+1 = 4.  The ingredients 7 5 6 have a score of (1*-3)+2 = -1.  Therefore, 1 2 3 beats 7 5 6.

Challenge

In this challenge, you shall write a program which takes an ordered list of 3 integers and outputs the corresponding score.

Input

Your program may accept a list of three integers in the most convenient format.  You are allowed to use either 1-indexing for the ingredient names (as above) or 0-indexing (subtract 1 from every index above).

Ouput

Your program must output a single integer indicating the score.

Test Cases

4 5 5  =&gt;  18 // max score
5 5 5  =&gt;  -27 // min score
13 13 13  =&gt;  0
1 2 3  =&gt;  4
7 5 6  =&gt;  -1
16 2 19  =&gt;  2
19 7 12  =&gt;  -6


*This page is pretty outdated and doesn't work in some browsers, but you don't need to play the game for this challenge.
Jelly, 24 bytes
“zẈ€$ụ¤’b6’ị@µỊị⁾+×żCFḊV

Takes a list of 0-indexed ingredients.
Try it online! or see a test suite
How?
Uses a slightly convoluted form of compressing the values as a base-6 number and the fact that the multiplicative entries are the negative ones. Instead of simply shifting up by 3 to get the base-6 digits, the complemented values incremented are used - this saves bytes by allowing the Ị atom to pick out the negative entries prior to the complement step while also saving a byte in the base-250 compression.
“zẈ€$ụ¤’b6’ị@µỊị⁾+×żCFḊV - Main link: 0-based ingredient list  e.g. [6,4,5]
“zẈ€$ụ¤’                 - base 250 compressed number: 120851767994004
        b6               - convert to base 6: [1,1,0,5,0,1,0,3,1,1,4,2,1,0,3,0,1,0,0]
          ’              - decrement: [0,0,-1,4,-1,0,-1,2,0,0,3,1,0,-1,2,-1,0,-1,-1]
           ị@            - index into [reversed @rguments]          [0,4,-1]
             µ           - monadic chain separation (call that x)
              Ị          - insignificant(x)? (abs(x)&lt;=1)            [1,0,1]
                ⁾+×      - ['+','×']
               ị         - index into                               ['+','×','+']
                    C    - complement(x) (1-x)                      [1,-3,2]
                   ż     - zip                                      [['+',1],['×',-3],['+',2]]
                     F   - flatten                                  ['+',1,'×',-3,'+',2]
                      Ḋ  - dequeue                                  [1,'×',-3,'+',2]
                       V - evaluate as Jelly code                   -1