You are given a grid of size \(N*M\). The rows are numbered from \(0\) to \(N - 1\), and the columns are numbered from \(0\) to \(M - 1\).
In a single move, you can go from \((x, y)\) to \(((x + A) \, mod \,N, y)\) or \((x, (y+B) \, mod \, M)\) where A and B are positive integers satisfying \(1 \leq A \leq N - 1\) and \(1 \leq B \leq M - 1\).
You are also given Q queries. You have to solve each query independently.
In each query, you will be given two positions (x1, y1) and (x2, y2). You have to find the number of possible pairs of (A, B) so that (x2, y2) is reachable from (x1, y1) using any number of moves (possibly zero).

Input Format:
The first line of the input contains two space-separated integers N and M representing the size of the grid.
The next line contains a single integer Q representing the number of queries.
The next Q lines contain 4 space-separated integers x₁, y₁, x₂, y₂.

Output Format:
Output Q lines, where the i^th line represents the answer to the i^th query.

Constraints:
\(2 \leq N, M \leq 10^5\)
\(1 \leq Q \leq 10^5\)
\(0 \leq x1, x2 \leq N - 1\)
\(0 \leq y1, y2 \leq M - 1\)