Foundations · Superchallenge problem

The numbers $1, 2, 3, 4, 5, 6$ are assigned to the letters $a, b, c, d, e, f$ in some order, each number used once. What is the largest possible value of $ab + ad + af + cb + cd + cf + eb + ed + ef$?