Correct Boards#3007
You have a rectangular board of dimensions M \times N, where each cell measures 1 \times 1 and is colored either black or white. The board is colored in a standard chessboard pattern, so any two adjacent cells have different colors. We call a board correct if it contains an equal number of black and white cells. Some number of vertical and horizontal cuts have been made, dividing the board into several smaller boards. Each cut extends from one edge of the board to the opposite edge: horizontal cuts go from left to right, and vertical cuts go from bottom to top.
Write a program to determine how many of the resulting boards are correct.
The first line contains two natural numbers and (1 \leq M, N \leq 10^9) — the vertical and horizontal dimensions of the board. The second line starts with , the number of horizontal cuts, followed by the positions m_1, m_2, \ldots, m_K — the distances from the bottom edge to each cut. These are integers in increasing order (1 \leq m_1 < \ldots < m_K < M). The third line provides , the number of vertical cuts, and the distances from the left edge to each cut n_1, n_2, \ldots, n_L (1 \leq n_1 < \ldots < n_L < N). The values and are between and 10^5.
Output a single number — the number of correct boards obtained after performing all the cuts.
Example 1