// This Code was made by Chinese_zjc_.
#include <bits/stdc++.h>
// #define debug
const int MOD = 998244353;
struct mint
{
    unsigned v;
    mint(unsigned v_ = 0) : v(v_) {}
    mint operator-() const { return v ? MOD - v : *this; }
    mint &operator+=(const mint &X) { return (v += X.v) >= MOD ? v -= MOD : v, *this; }
    mint &operator-=(const mint &X) { return (v += MOD - X.v) >= MOD ? v -= MOD : v, *this; }
    mint &operator*=(const mint &X) { return v = 1llu * v * X.v % MOD, *this; }
    mint &operator/=(const mint &X) { return *this *= X.inv(); }
    mint pow(long long B) const
    {
        B %= MOD - 1;
        if (B < 0)
            B += MOD - 1;
        mint res = 1, A = *this;
        while (B)
        {
            if (B & 1)
                res *= A;
            B >>= 1;
            A *= A;
        }
        return res;
    }
    mint inv() const { return pow(MOD - 2); }
    friend mint operator+(const mint &A, const mint &B) { return mint(A) += B; }
    friend mint operator-(const mint &A, const mint &B) { return mint(A) -= B; }
    friend mint operator*(const mint &A, const mint &B) { return mint(A) *= B; }
    friend mint operator/(const mint &A, const mint &B) { return mint(A) /= B; }
    friend std::istream &operator>>(std::istream &A, mint &B) { return A >> B.v; }
    friend std::ostream &operator<<(std::ostream &A, const mint &B) { return A << B.v; }
    friend bool operator==(const mint &A, const mint &B) { return A.v == B.v; }
    explicit operator bool() const { return v; }
} dp[505][1 << 14];
int n, m, r, tot;
struct node
{
    int x, y, d;
};
std::vector<node> g[505];
std::vector<std::pair<int, int>> to[1 << 14];
void dfs(int l, int r, int L, int R, int V)
{
    if (l == n)
    {
        if (r != n)
            return;
        to[L].push_back({R, V});
        ++tot;
        return;
    }
    dfs(l + 1, r, L, R, V);
    if (l == r)
        for (int i = 1; i <= n - r; ++i)
            dfs(l + 1, r + i, L | 1 << l, R | 1 << (l + i - 1), V | 1 << (r + i - 1));
    if (r < l)
        dfs(l + 1, l + 1, L | 1 << l, R | 1 << r, V | 1 << l);
}
signed main()
{
    std::ios::sync_with_stdio(false);
    std::cin >> n >> m >> r;
    dfs(0, 0, 0, 0, 0);
    for (int i = 1, c, x, y, d; i <= r; ++i)
    {
        std::cin >> c >> x >> y >> d;
        if (c == 1 && !d)
            return std::cout << 0 << std::endl, 0;
        g[c].push_back({--x, --y, d});
    }
    std::fill(dp[1], dp[1] + (1 << n), 1);
    for (int i = 2; i <= m; ++i)
    {
        for (int j = 0; j != 1 << n; ++j)
            if (dp[i - 1][j])
                for (auto k : to[j])
                {
                    bool flag = true;
                    for (auto l : g[i])
                        flag &= bool((k.second & ((1 << l.y) - 1)) >> l.x) == l.d;
                    if (flag)
                        dp[i][k.first] += dp[i - 1][j];
                }
        for (int j = 0; j != n; ++j)
            for (int k = 0; k != 1 << n; ++k)
                if (k >> j & 1)
                    dp[i][k ^ 1 << j] += dp[i][k];
    }
    std::cout << dp[m][0] << std::endl;
    return 0;
}