#include <bits/stdc++.h>
#define ppc __builtin_popcount
#define ctz __builtin_ctz
#define lowbit(x) (x & -x)
using namespace std;
const int MOD = 998244353;
int n, m, r, dp[510][1 << 14], vis[1 << 14];
struct info
{
    int x, y, diff;
};
vector<info> restrict[510];
vector<int> nxt[1 << 14];
int mo(int x)
{
    if (x >= MOD)
        x -= MOD;
    return x;
}
inline bool check(int i, int j)
{
    if (ppc(i) != ppc(j))
        return 0;
    int uni = 0, cnt = 0;
    for (; j; j -= lowbit(j), i -= lowbit(i))
    {
        int x = min(ctz(i), ctz(j)), y = max(ctz(i), ctz(j));
        int cur = (1 << y + 1 - x) - 1 << x;
        uni |= cur, cnt += y + 1 - x;
    }
    return uni == (1 << n) - 1 && cnt == n;
}
int main()
{
    cin >> n >> m >> r;
    for (int i = 0; i < 1 << n; i++)
        if (i & 1)
            for (int j = i;; j = (j - 1) & i)
            {
                int k = 0, jj = 0;
                for (int l = 0, r; l < n; l = r + 1)
                {
                    r = l + 1;
                    while (r < n && ~i >> r & 1)
                        r++;
                    r--;
                    if (~j >> l & 1)
                        k |= 1 << r, jj |= 1 << l;
                    else
                        jj |= 1 << r, k |= 1 << l;
                }
                nxt[jj].push_back(k);
                if (!j)
                    break;
            }
    for (int i = 0; i < 1 << n; i++)
    {
        vector<int> tmp = nxt[i];
        for (int j : nxt[i])
            tmp.push_back(j);
        nxt[i].clear();
        for (int j : tmp)
        {
            if (vis[j])
                continue;
            vis[j] = 1;
            nxt[i].push_back(j);
        }
        for (int j : tmp)
            vis[j] = 0;
    }

    for (int i = 0; i < r; i++)
    {
        int c, x, y, diff;
        cin >> c >> x >> y >> diff;
        restrict[c].push_back({x, y, diff});
        if (c == 1 && !diff)
        {
            cout << 0;
            return 0;
        }
    }
    dp[1][(1 << n) - 1] = 1;
    for (int c = 2; c <= m; c++)
    {
        for (int k = 0; k < n; k++)
            for (int i = 0; i < 1 << n; i++)
                if (i >> k & 1)
                {
                    int j = i ^ (1 << k);
                    dp[c - 1][j] = mo(dp[c - 1][j] + dp[c - 1][i]);
                }
        for (int i = 0; i < 1 << n; i++)
            for (int j : nxt[i])
            {
                bool sign = 1;
                for (auto [x, y, diff] : restrict[c])
                {
                    int ii, jj;
                    for (jj = j, ii = i;; jj -= lowbit(jj), ii -= lowbit(ii))
                    {
                        if (min(ctz(ii - lowbit(ii)), ctz(jj - lowbit(jj))) >= x)
                            break;
                    }
                    if (diff)
                    {
                        if (max(ctz(ii), ctz(jj)) >= y - 1)
                            sign = 0;
                    }
                    else
                    {
                        if (max(ctz(ii), ctz(jj)) < y - 1)
                            sign = 0;
                    }
                }
                if (sign)
                    dp[c][j] = mo(dp[c][j] + dp[c - 1][i]);
            }
    }
    int ans = 0;
    for (int i = 0; i < 1 << n; i++)
    {
        ans = mo(ans + dp[m][i]);
    }
    cout << ans;
}