#include <bits/stdc++.h>
using namespace std;
const int N = 510;
const int M = 1 << 14;
const int S = 2e5 + 10;
const int p = 998244353;
int n, m, rn;
int tot, to[S], col[S][14];
vector<int> g[M];
vector<tuple<int, int, int>> R[N];
inline pair<vector<int>, int> Simulate(int ps, int dir) {
    vector<int> col(n);
    int n_ps = 0, colnum = 0;
    for (int x = 0; x < n; ++x) if (ps >> x & 1) {
        col[x] = ++colnum;
        int t = x;
        if (t && (~ps >> (t - 1) & 1) && (dir >> (t - 1) & 1)) {
            while (t && (~ps >> (t - 1) & 1) && (dir >> (t - 1) & 1)) {
                --t;
                col[t] = colnum;
            }
        } else {
            while (t + 1 < n && (~ps >> (t + 1) & 1) && (~dir >> (t + 1) & 1)) {
                ++t;
                col[t] = colnum;
            }
        }
        n_ps |= 1 << t;
    }
    return {col, n_ps};
}
inline void A(int &x, int y) {
    x = (x + y >= p ? x + y - p : x + y);
}
int f[N][M];
int main() {
    scanf("%d%d%d", &n, &m, &rn);
    for (int i = 1, c, x, y, d; i <= rn; ++i) {
        scanf("%d%d%d%d", &c, &x, &y, &d);
        if (c == 1 && d == 0) return puts("0"), 0;
        R[c].push_back({x - 1, y - 1, d});
    }
    for (int i = 1; i < (1 << n); ++i) {
        int tmp = ((1 << n) - 1) ^ i;
        vector<int> ps;
        for (int j = tmp; ; j = (j - 1) & tmp) {
            auto [cur_col, cur_ps] = Simulate(i, j);
            if (*min_element(cur_col.begin(), cur_col.end()) != 0) {
                copy(cur_col.begin(), cur_col.end(), col[tot]);
                to[tot] = cur_ps;
                g[i].push_back(tot);
                ++tot;
            }
            if (!j) break;
        }
    }
    cerr << tot << endl;
    f[2][(1 << n) - 1] = 1;
    for (int r = 2; r <= m; ++r) {
        for (int i = 0; i < n; ++i)
            for (int s = 0; s < (1 << n); ++s)
                if (s >> i & 1) 
                    A(f[r][s ^ (1 << i)], f[r][s]);
        for (int i = 0; i < (1 << n); ++i) if (f[r][i]) 
            for (auto j : g[i]) {
                bool flag = 1;
                for (auto [x, y, d] : R[r]) if ((col[j][x] == col[j][y]) ^ d ^ 1) flag = 0;
                if (flag) A(f[r + 1][to[j]], f[r][i]);
            }
    }
    int ans = 0;
    for (int i = 0; i < (1 << n); ++i) A(ans, f[m + 1][i]);
    printf("%d\n", ans);
    return 0;
}