Not the Same Way Back

Difficulty: Medium · Topics: Discrete Mathematics, Counting Principle

There are 5 different roads from city A to city B and 3 different roads from city B to city C.

In how many ways can someone travel from A to C and back again, if the return journey must not use exactly the same route as the outward one?