// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 14;
const int MAXM = 505;
const int MOD = 998244353;

inline void add(int &x, const int y) {
    x += y;
    if (x >= MOD) {
        x -= MOD;
    }
}

int n, m, r;
int lomn[MAXM][MAXN], lomx[MAXM][MAXN], himn[MAXM][MAXN], himx[MAXM][MAXN];
int dp[1 << MAXN], tdp[MAXN][1 << MAXN];

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n >> m >> r;
    REP (i, 1, m + 1) {
        REP (j, 0, n) {
            lomn[i][j] = himn[i][j] = -INF;
            lomx[i][j] = himx[i][j] = INF;
        }
    }
    bool pos = 1;
    while (r--) {
        int c, x, y, d; cin >> c >> x >> y >> d;
        x--; y--;
        if (d) {
            mnto(himx[c][x], y - 1);
            mxto(lomn[c][y], x + 1);
        } else {
            if (c == 1) {
                pos = 0;
            }
            mxto(himn[c][x], y);
            mnto(lomx[c][y], x);
        }
    }
    if (!pos) {
        cout << 0 << '\n';
        return 0;
    }
    REP (msk, 0, 1 << n) {
        dp[msk] = 1;
    }
    REP (c, 2, m + 1) {
        REP (i, 0, n) {
            REP (msk, 0, 1 << n) {
                tdp[i][msk] = 0;
            }
        }
        REP (i, -1, n - 1) {
            int *cdp;
            if (i == -1) {
                cdp = dp;
            } else {
                cdp = tdp[i];
            }
            REP (msk, 0, 1 << n) {
                if (cdp[msk] == 0) {
                    continue;
                }
                bool ib = msk >> (i + 1) & 1;
                int nmsk = msk;
                int mn = -INF, mx = INF;
                REP (j, i + 1, n) {
                    bool on = j > i + 1 && (msk >> j & 1);
                    if (ib && on) {
                        break;
                    }
                    if (i + 1 < lomn[c][j] || i + 1 > lomx[c][j]) {
                        break;
                    }
                    mxto(mn, himn[c][j]);
                    mnto(mx, himx[c][j]);
                    if (j > mx) {
                        break;
                    }
                    nmsk &= ~(1 << j);
                    if (j >= mn && (ib || on)) {
                        add(tdp[j][nmsk], cdp[msk]);
                        add(tdp[j][nmsk ^ (1 << (ib ? j : i + 1))], cdp[msk]);
                    }
                    if (on) {
                        break;
                    }
                }
            }
        }
        REP (msk, 0, 1 << n) {
            dp[msk] = tdp[n - 1][msk];
        }
    }
    cout << dp[0] << '\n';
    return 0;
}