The figure shows a diagram of the roads connecting the cities A, B, C, D, D, E, W, H, I, K, L, M. On each road, you can move only in one direction, indicated by the arrow. How many different ways are there from city A to city M that do not pass through city D?
(Image can be enlarged by clicking on it. Will open in a new window)