#include<bits/stdc++.h>

using namespace std;
#define int long long
const int md = 998244353;

void mod(int &x) {
    if (x >= md) x -= md;
}

pair<int, int> check(int mask, int n) {
    int a[2] = {};
    for (int bit = 0; bit < 2 * n; ++bit) {
        if ((mask >> bit) & 1) {
            a[bit % 2] |= 1 << (bit / 2);
        }
    }
    if (__builtin_popcount(a[0]) != __builtin_popcount(a[1])) return {0, 0};
    int k = __builtin_popcount(a[0]);
    vector<int> pref(n + 1);
    int ib = 0, jb = 0;

    vector<int> aa(n + 1);
    int u = 1;
    for (int idx = 0; idx < k; ++idx) {
        while (((a[0] >> ib) & 1) == 0) ib++;
        while (((a[1] >> jb) & 1) == 0) jb++;
        int l = ib, r = jb;
        if (l > r) swap(l, r);
        for (int i = l; i <= r; ++i) aa[i] = u;
        u++;
        pref[l]++;
        pref[r + 1]--;
        ib++, jb++;
    }
    bool ok = pref[0] == 1 && pref[n] == -1;
    for (int idx = 1; idx < n; ++idx) ok &= pref[idx] == 0;
    if (!ok) return {0, 0};
    //for (int x : aa) cout << x << ' ' ;cout << endl;
    return {a[0], a[1]};
}

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n = 14, m, r;
    cin >> n >> m >> r;
    vector<vector<array<int, 3>>> res(m);
    for (int i = 0; i < r; ++i) {
        int c, x, y, d;
        cin >> c >> x >> y >> d;
        --c, --x, --y;
        res[c].push_back({x, y, d});
    }
    int mask = 0;
    vector<vector<int>> p(1 << n);
    vector<int> cnt(n + 1);
    while (mask < (1 << 2 * n)) {
        int cur = 0;
        bool ok = true;
        int h = 0;
        for (int bit = 2 * n - 1; bit >= 0; --bit) {
            if ((mask >> bit) & 1) cur += (bit % 2 == 0 ? 1 : -1);
            if (cur == 0) h++; else h = 0;
            if (h >= 4 || abs(cur) == 2) {
                mask = (mask / (1 << bit) + 1) * (1 << bit);
                ok = false;
                break;
            }
        }
        if (!ok) continue;
        auto [x, y] = check(mask, n);
        int rem = x, nxt = y;
        {
            int k = __builtin_popcount(rem);
            int ib = 0, jb = 0;
            vector<int> a(n + 1);
            int u = 1;
            for (int idx = 0; idx < k; ++idx) {
                while (((rem >> ib) & 1) == 0) ib++;
                while (((nxt >> jb) & 1) == 0) jb++;
                int l = ib, r = jb;
                if (l > r) swap(l, r);
                for (int i = l; i <= r; ++i) a[i] = u;
                u++;
                ib++, jb++;
            }

        }
        mask++;
        if (x == 0) continue;
        cnt[__builtin_popcount(x)]++;
        if (x && y) p[x].push_back(y);
    }
    vector<vector<vector<int>>> aaa(1 << n);
    for (int i = 0; i < (1 << n); ++i) {
        for (int j = 0; j < p[i].size(); ++j) {
            int mask = i, nxt = p[i][j];
            int ib = 0, jb = 0;
            int k = __builtin_popcount(mask);
            vector<int> a(n + 1);
            int u = 1;
            for (int idx = 0; idx < k; ++idx) {
                while (((mask >> ib) & 1) == 0) ib++;
                while (((nxt >> jb) & 1) == 0) jb++;
                int l = ib, r = jb;
                if (l > r) swap(l, r);
                for (int i = l; i <= r; ++i) a[i] = u;
                u++;
                ib++, jb++;
            }
            aaa[i].push_back(a);
        }
    }
    vector<vector<int>> dp(m + 1, vector<int>(1 << n));
    dp[1].back() = 1;
    for (int j = 1; j < m; ++j) {
        for(int i=0;i<n;++i) {for(int mask=0;mask<(1<<n);++mask) if((mask & (1<<i))) {dp[j][mask-(1<<i)]+=dp[j][mask];dp[j][mask-(1<<i)]%=md;}}
        /*auto c = dp;
        fill(dp[j].begin(),dp[j].end(), 0);
        for (int mask = 0; mask < (1 << n); ++mask) {
            for (int over = 0; over < (1 << n); ++over) {
                if ((mask & over) == mask) dp[j][mask] += c[j][over];
            }
        }*/
        for (int mask = 0; mask < (1 << n); ++mask) {
            if (dp[j][mask] == 0) continue;
            for (int jj = 0; jj < p[mask].size(); ++jj) {
                bool ok = true;
                vector<pair<int, int>> s;
                int ib = 0, jb = 0;

                //for (int i = 0; i < n; ++i) cout << a[i] << ' ' ;cout << endl;
                for (auto [x, y, d]: res[j]) {
                    if (d == 0 && aaa[mask][jj][x] != aaa[mask][jj][y]) {
                        ok = false;
                        break;
                    }
                    if (d == 1 && aaa[mask][jj][x] == aaa[mask][jj][y]) {
                        ok = false;
                        break;
                    }
                }
                if (ok) {
                    dp[j + 1][p[mask][jj]] += dp[j][mask];
                    mod(dp[j + 1][p[mask][jj]]);
                }
            }
        }
    }

    int sum = accumulate(dp[m].begin(), dp[m].end(), 0LL);
    cout << sum % md << '\n';
    return 0;
}
/*
 * 1: 2
2: 48
3: 486
4: 2720
5: 9290
6: 20256
7: 28814
8: 27008
9: 16722
10: 6800
11: 1782
12: 288
13: 26
 */