#include <bits/stdc++.h>
using namespace std;
const int maxn = 3700;
const int mod = 998244353;
inline int add(int a, int b) { return ((a + b) >= mod) ? a + b - mod : a + b; }
inline int sub(int a, int b) { return add(a, mod - b); }
inline int mul(int a, int b) { return (a * 1LL * b) % mod; }
int n, m, k;
int rowtaken[maxn], coltaken[maxn];
int dp1[maxn][maxn], dp2[maxn][maxn];
int npr[maxn][maxn];
int main() {
  npr[0][0] = 1;
  for (int i = 1; i <= 3600; i++) {
    npr[i][0] = 1;
    npr[i][1] = i;
    for (int j = 2; j <= i; j++) {
      npr[i][j] = mul(npr[i][j - 1], i - j + 1);
    }
  }
  cin >> n >> m >> k;
  for (int i = 1; i <= k; i++) {
    int x1, y1, x2, y2;
    scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
    rowtaken[x1] = rowtaken[x2] = 1;
    coltaken[y1] = coltaken[y2] = 1;
  }
  dp1[0][0] = dp2[0][0] = 1;
  int xx = 0, yy = 0;
  for (int i = 1; i <= n; i++) {
    dp1[i][0] = 1;
    xx += rowtaken[i];
    for (int j = 1; j <= i; j++) {
      dp1[i][j] = dp1[i - 1][j];
      if (rowtaken[i] == 0 && rowtaken[i - 1] == 0)
        dp1[i][j] = add(dp1[i][j], dp1[i - 2][j - 1]);
    }
  }
  for (int i = 1; i <= m; i++) {
    dp2[i][0] = 1;
    yy += coltaken[i];
    for (int j = 1; j <= i; j++) {
      dp2[i][j] = dp2[i - 1][j];
      if (coltaken[i] == 0 && coltaken[i - 1] == 0)
        dp2[i][j] = add(dp2[i][j], dp2[i - 2][j - 1]);
    }
  }
  int anss = 0;
  for (int i = 0; i <= n; i++) {
    if (n - 2 * i - xx < 0) break;
    for (int j = 0; j <= m; j++) {
      if (m - 2 * j - yy < 0) break;
      int row2s = i;
      int rowbaki = n - 2 * i - xx;
      int row1s = j;
      int col2s = j;
      int colbaki = m - 2 * j - yy;
      int col1s = i;
      int tmp1 = mul(dp1[n][row2s], npr[colbaki][col1s]);
      int tmp2 = mul(dp2[m][col2s], npr[rowbaki][row1s]);
      int tmp = mul(tmp1, tmp2);
      anss = add(anss, tmp);
    }
  }
  cout << anss << endl;
  return 0;
}
