#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;


int N, M, R;
vector<int> C, X, Y, D;

int colorss[1 << 14][14];
vector<pair<int, int>> trans[1 << 14];

int main() {
  for (; ~scanf("%d%d%d", &N, &M, &R); ) {
    C.resize(R);
    X.resize(R);
    Y.resize(R);
    D.resize(R);
    for (int r = 0; r < R; ++r) {
      scanf("%d%d%d%d", &C[r], &X[r], &Y[r], &D[r]);
      --C[r];
      --X[r];
      --Y[r];
    }
    
Int counter=0;
    for (int p = 1; p < 1 << N; p += 2) {
      vector<int> cuts;
      cuts.push_back(0);
      for (int i = 1; i < N; ++i) if (p >> i & 1) {
        cuts.push_back(i);
      }
      const int len = cuts.size();
      cuts.push_back(N);
      for (int j = 0; j < len; ++j) {
        fill(colorss[p] + cuts[j], colorss[p] + cuts[j + 1], j);
      }
      int base = 0;
      vector<int> js;
      for (int j = 0; j < len; ++j) {
        if (cuts[j + 1] - cuts[j] == 1) {
          base |= 1 << cuts[j];
        } else {
          js.push_back(j);
        }
      }
      const int jsLen = js.size();
      trans[p].clear();
      for (int q = 0; q < 1 << jsLen; ++q) {
++counter;
        int s = base, t = base;
        for (int k = 0; k < jsLen; ++k) {
          const int j = js[k];
          if (q >> k & 1) {
            s |= 1 << cuts[j];
            t |= 1 << (cuts[j + 1] - 1);
          } else {
            s |= 1 << (cuts[j + 1] - 1);
            t |= 1 << cuts[j];
          }
        }
        trans[p].emplace_back(s, t);
      }
    }
cerr<<"counter = "<<counter<<endl;
    
    vector<vector<int>> rss(M);
    for (int r = 0; r < R; ++r) {
      rss[C[r]].push_back(r);
    }
    
    bool ok0 = true;
    for (const int r : rss[0]) {
      ok0 = ok0 && ((X[r] != Y[r]) == D[r]);
    }
    
    Mint ans = 0;
    if (ok0) {
      vector<Mint> crt(1 << N, 1);
      for (int m = 1; m < M; ++m) {
        vector<Mint> nxt(1 << N, 0);
        for (int p = 1; p < 1 << N; p += 2) {
          bool ok = true;
          for (const int r : rss[m]) {
            ok = ok && ((colorss[p][X[r]] != colorss[p][Y[r]]) == D[r]);
          }
          if (ok) {
            for (const auto &e : trans[p]) {
              nxt[e.second] += crt[e.first];
            }
          }
        }
        // end some
        for (int i = 0; i < N; ++i) {
          for (int p = 0; p < 1 << N; ++p) if (!(p & 1 << i)) {
            nxt[p] += nxt[p | 1 << i];
          }
        }
        crt.swap(nxt);
      }
      ans += crt[0];
    }
    printf("%u\n", ans.x);
  }
  return 0;
}