H1. Window Signals (easy version)
time limit per test
7 seconds
memory limit per test
512 megabytes
input
standard input
output
standard output

This is the easy version of the problem. In this version, the constraints on $h$ and $w$ are lower.

A house at the sea has $h$ floors, all of the same height. The side of the house facing the sea has $w$ windows at equal distances from each other on every floor. Thus, the windows are positioned in cells of a rectangular grid of size $h \times w$.

In every window, the light can be turned either on or off, except for the given $k$ (at most $2$) windows. In these $k$ windows the light can not be turned on, because it is broken.

In the dark, we can send a signal to a ship at sea using a configuration of lights turned on and off. However, the ship can not see the position of the lights with respect to the house. Thus, if one configuration of windows with lights on can be transformed into another using parallel translation, these configurations are considered equal. Note that only parallel translation is allowed, but neither rotations nor flips are. Moreover, a configuration without any light at all is not considered valid.

Find how many different signals the ship can receive and print this number modulo $998\,244\,353$.

Input

Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1 \le t \le 100$). The description of the test cases follows.

The first line of each test case contains three integers $h$, $w$, and $k$ ($1 \le h, w \le 40$; $0 \le k \le \min(h \cdot w, 2)$) — the height of the house, the number of windows on each floor, and the number of windows with broken lights.

If $k > 0$, each of the next $k$ lines contains two integers $r_i$ and $c_i$ ($1 \le r_i \le h$; $1 \le c_i \le w$) — the floor number and the window number with the broken light. The floors are numbered $1$ to $h$ from bottom to top, and the windows are numbered $1$ to $w$ from left to right. If $k = 2$, then either $r_1 \ne r_2$ or $c_1 \ne c_2$.

It is guaranteed that the sum of $h \cdot w$ over all test cases does not exceed $1600$.

Output

For each test case, print a single integer — the number of signals the ship can receive, modulo $998\,244\,353$.

Example
Input
101 3 02 2 03 2 04 5 012 7 01 1 11 11 3 11 23 4 13 42 3 21 12 14 5 22 34 2
Output
4
10
44
954368
34903934
0
2
1696
10
253144

Note

In the first test case, the ship can receive four different signals: all lights on; lights on in two neighboring windows; lights on in the leftmost and the rightmost windows; or light on in any single window.