Paths

In each problem you need to find the number of ways to get from city A to city Z.

‍

1.

‍

2.

‍

3.

‍

4.‍

‍

5.

‍

6.

‍

7.‍

‍

8.

‍

9.

‍