#include <bits/extc++.h>
using namespace std;
using i64 = int64_t;
using f64 = double_t;
constexpr int mod = 998244353;
void add(int &x, int y) {
  if ((x += y) >= mod) { x -= mod; }
}
int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n, m, r;
  cin >> n >> m >> r;
  vector<vector<tuple<int, int, int>>> restr(m + 1);
  for (int i = 0; i < r; i += 1) {
    int c, x, y, diff;
    cin >> c >> x >> y >> diff;
    if (c == 1 and diff == 0) {
      cout << 0;
      return 0;
    }
    restr[c].emplace_back(x, y, diff);
  }
  vector<vector<pair<int, int>>> g(1 << n);
  int edge = 0;
  for (int i = 0; i < (1 << (n - 1)); i += 1) {
    vector<unsigned> p;
    int x = i | (1 << (n - 1)), y = 0;
    for (int j = 0; j < n; j += 1) {
      if ((x >> j) % 2) {
        p.push_back(1 << y | 1 << j);
        y = j + 1;
      }
    }
    for (int j = 0; j < (1 << n); j += 1) {
      function<void(int, int)> dfs = [&](int k, int cur) {
        if (k == size(p)) {
          g[j].emplace_back(i, cur);
          edge += 1;
          return;
        }
        if (j & p[k]) {
          if (popcount(p[k]) == 1) {
            dfs(k + 1, cur | p[k]);
          } else {
            int x = p[k] & -p[k], y = p[k] ^ x;
            if (j & x) { dfs(k + 1, cur | y); }
            if (j & y) { dfs(k + 1, cur | x); }
          }
        }
      };
      dfs(0, 0);
    }
  }
  vector<int> f(1 << n);
  f.back() = 1;
  for (int i = 2; i <= m; i += 1) {
    vector<int> h(1 << n);
    for (int j = 0; j < (1 << n); j += 1) {
      if (f[j]) {
        for (auto [w, t] : g[j]) {
          bool ok = true;
          for (auto [x, y, diff] : restr[i]) {
            x -= 1;
            y -= 1;
            int mask = (1 << y) - (1 << x);
            if (bool(mask & w) != diff) {
              ok = false;
              break;
            }
          }
          if (ok) { add(h[t], f[j]); }
        }
      }
    }
    f.swap(h);
  }
  int ans = 0;
  for (auto fi : f) { add(ans, fi); }
  cout << ans << "\n";
  cerr << edge;
}