You and other players are each given tickets to distribute into three buckets with prizes and . One winning ticket is drawn from each bucket, and the winner gets the associated prize. A single person can win multiple buckets. You are the last person to put in your tickets and are told that the number of tickets in each bucket are currently allocated proportionally to the size of the prize of the bucket. Assuming your utility is binary past (i.e. you get utility from and , but utility from ), how should you arrange your tickets to maximize expected utility? Report the expected utility under this strategy.