191. Pat will walk from Intersection X to Intersection Y along a route that is confined to the square grid of four streets and three avenues shown in the map above. How many routes from X to Y can Pat take that have the minimum possible length? 这个题问的是说P从X沿着东西向的4条街道和3条南北向的街道走到Y,问最短路径有多少条路线?(只需要理解成从点X到点Y沿着格子的最短路径有多少条。)