Arthur is taking the MITx MicroMasters in Supply Chain Management and decided to help Lillian, his mother, with the baskets distribution. He thinks the Clark-Wright savings algorithm method can better optimize the delivery process.

Arthur calculates and sorts the distance savings for every pair of markets, what are the 3 highest (top 3) values of savings (in miles)?

Note: Do not use any optimization process beyond the Clark-Wright method. Arthur assumes that the van has no capacity constraint. Input your answer in the following boxes in order:

1st highest savings

Round your answer to the nearest integer.

2nd highest savings

Round your answer to the nearest integer.

3rd highest savings

Round your answer to the nearest integer.