Game on Chessboard

You are given an $M \times N$ chessboard. On it sit $K$ fairy chess pieces called $(p, q)$-leapers (with $p < q$). Squares are addressed by (row, column), with rows numbered $1$ to $M$ from top to bottom and columns numbered $1$ to $N$ from left to right. Several leapers may occupy the same square.

A $(p, q)$-leaper standing on square $(r, c)$ can move to any of the following four squares that lie on the board:

• $(r-q,\ c+p)$
• $(r-q,\ c-p)$
• $(r+p,\ c-q)$
• $(r-p,\ c-q)$

In each move the piece steps $p$ squares along one axis and $q$ squares along the other, and the length-$q$ step always points toward a smaller coordinate (upward in rows or leftward in columns). A move that would leave the board is forbidden.

Two players move alternately. On a turn, a player selects one leaper and moves it according to the rules above. The player who has no legal move on their turn loses. Assuming both players play optimally, determine who wins.

The first line contains five integers $M$, $N$, $K$, $p$, $q$ ($1 \le M, N \le 10^9$, $1 \le K \le 10^5$, $1 \le p < q \le 20$).

Each of the next $K$ lines contains two integers $r_i$ and $c_i$, the position of the $i$-th leaper ($1 \le r_i \le M$, $1 \le c_i \le N$).

Print First if the player who moves first wins under optimal play, and Second otherwise.