Grid Paths

View as PDF

Points: 10 (partial)
Time limit: 2.0s
Memory limit: 64M

Author:
Problem type

In a grid of size by , you are to determine the amount of paths from the square to the square that do not go through blocked off squares only moving to the right or up. .

Input Specification

The first line will contain three integers, , , and .

The next lines will contain two integers and .

Output Specification

On one line, you are to output the number of valid paths through the grid modulo .

4 4 0
20