Problem: Consider a square grid with h rows and w columns with some dominoes on it. Each domino covers exactly two cells of the grid that share a common side. Every cell is covered by at most one domino.

Let's call a placement of dominoes on the grid perfectly balanced if no row and no column contains a pair of cells covered by two different dominoes. In other words, every row and column may contain no covered cells, one covered cell, or two covered cells that belong to the same domino.

You are given a perfectly balanced placement of dominoes on a grid. Find the number of ways to place zero or more extra dominoes on this grid to keep the placement perfectly balanced. Output this number modulo 998 244 353.

Input

The first line contains three integers h, w, and n (1 ≤ h, w ≤ 3600; 0 ≤ n ≤ 2400), denoting the dimensions of the grid and the number of already placed dominoes. The rows are numbered from 1 to h, and the columns are numbered from 1 to w.

Each of the next n lines contains four integers r_{i, 1}, c_{i, 1}, r_{i, 2}, c_{i, 2} (1 ≤ r_{i, 1} ≤ r_{i, 2} ≤ h; 1 ≤ c_{i, 1} ≤ c_{i, 2} ≤ w), denoting the row id and the column id of the cells covered by the i-th domino. Cells (r_{i, 1}, c_{i, 1}) and (r_{i, 2}, c_{i, 2}) are distinct and share a common side.

The given domino placement is perfectly balanced.

Output

Output the number of ways to place zero or more extra dominoes on the grid to keep the placement perfectly balanced, modulo 998 244 353.

Examples

Input


5 7 2
3 1 3 2
4 4 4 5


Output


8


Input


5 4 2
1 2 2 2
4 3 4 4


Output


1


Input


23 42 0


Output


102848351

Note

In the first example, the initial grid looks like this:

<image>

Here are 8 ways to place zero or more extra dominoes to keep the placement perfectly balanced:

<image>

In the second example, the initial grid looks like this:

<image>

No extra dominoes can be placed here.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#pragma GCC optimize(4)
using namespace std;
char _buf[100000], *_p1 = _buf, *_p2 = _buf;
inline int gi() {
  int x = 0, f = 1;
  char ch = (_p1 == _p2 && (_p2 = (_p1 = _buf) + fread(_buf, 1, 100000, stdin),
                            _p1 == _p2)
                 ? EOF
                 : *_p1++);
  while (ch > '9' || ch < '0') {
    if (ch == '-') f = -1;
    ch = (_p1 == _p2 && (_p2 = (_p1 = _buf) + fread(_buf, 1, 100000, stdin),
                         _p1 == _p2)
              ? EOF
              : *_p1++);
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 3) + (x << 1) + (ch ^ 48);
    ch = (_p1 == _p2 && (_p2 = (_p1 = _buf) + fread(_buf, 1, 100000, stdin),
                         _p1 == _p2)
              ? EOF
              : *_p1++);
  }
  return (f == 1) ? x : -x;
}
inline int max(int a, int b) { return a > b ? a : b; }
inline int min(int a, int b) { return a < b ? a : b; }
const int maxn = 3605, mod = 998244353;
int n, m, k, x, y;
long long f[maxn][maxn], g[maxn][maxn];
bool visx[maxn], visy[maxn];
long long inv[maxn], fac[maxn];
inline long long C(int x, int y) {
  if (x < y) return 0;
  return ((fac[x] * inv[y] % mod) * inv[x - y] % mod);
}
inline void init() {
  inv[0] = inv[1] = fac[0] = fac[1] = 1;
  for (int i = 2; i <= 3600; ++i)
    fac[i] = fac[i - 1] * i % mod,
    inv[i] = (mod - mod / i) * inv[mod % i] % mod;
  for (int i = 2; i <= 3600; ++i) inv[i] = (inv[i] * inv[i - 1]) % mod;
}
inline void input() {
  n = gi(), m = gi(), k = gi();
  for (int i = 1; i <= k; ++i) {
    x = gi(), y = gi();
    visy[x] = 1, visx[y] = 1;
    x = gi(), y = gi();
    visy[x] = 1, visx[y] = 1;
  }
}
inline void solve() {
  int cntx = 0, cnty = 0;
  int maxv = max(n, m);
  for (int i = 0; i <= n; ++i) f[i][0] = 1;
  for (int i = 1; i <= m; ++i)
    if (!visx[i]) cntx++;
  for (int i = 1; i <= n; ++i)
    if (!visy[i]) cnty++;
  for (int i = 2; i <= n; ++i) {
    for (int j = 1; j <= maxv; ++j) {
      f[i][j] = f[i - 1][j];
      if (!visy[i] && !visy[i - 1]) f[i][j] = (f[i][j] + f[i - 2][j - 1]) % mod;
    }
  }
  for (int i = 0; i <= m; ++i) g[i][0] = 1;
  for (int i = 2; i <= m; ++i) {
    for (int j = 1; j <= maxv; ++j) {
      g[i][j] = g[i - 1][j];
      if (!visx[i] && !visx[i - 1]) g[i][j] = (g[i][j] + g[i - 2][j - 1]) % mod;
    }
  }
  long long ans = 0;
  for (int i = 0; i <= maxv; ++i) {
    for (int j = 0; j <= maxv; ++j) {
      if (2 * i + j <= cntx && 2 * j + i <= cnty)
        ;
      else
        continue;
      long long sum = g[m][i] * f[n][j] % mod;
      sum = (sum * C(cntx - 2 * i, j) % mod) * C(cnty - 2 * j, i) % mod;
      sum = sum * (fac[i] * fac[j] % mod) % mod;
      ans = (ans + sum) % mod;
    }
  }
  printf("%lld\n", ans);
}
int main() {
  init();
  input();
  solve();
  return 0;
}