// Not afraid to dark.

#include <bits/stdc++.h>
using namespace std;

clock_t start_time, end_time;
#define GET_START start_time = clock ();
#define GET_END end_time = clock (); fprintf (stderr, "TIME COSSEMED : %0.3lf\n", 1.0 * (end_time - start_time) / CLOCKS_PER_SEC);
#define inline __inline__ __attribute__ ((always_inline))

namespace io {
    int read_pos, read_dt; char read_char;
    inline int read (int &p = read_pos){
        p = 0, read_dt = 1; read_char = getchar ();
        while (! isdigit (read_char)){
            if (read_char == '-')
                read_dt = - 1;
            read_char = getchar ();
        }
        while (isdigit (read_char)){
            p = (p << 1) + (p << 3) + read_char - 48;
            read_char = getchar ();
        }
        return p = p * read_dt;
    }
    int write_sta[65], write_top;
    inline void write (int x){
        if (x < 0)
            putchar ('-'), x = - x;
        write_top = 0;
        do
            write_sta[write_top ++] = x % 10, x /= 10;
        while (x);
        while (write_top)
            putchar (write_sta[-- write_top] + 48);
    }
}

const int N = 14, M = 5e2, mod = 998244353;

int n, m, r;

struct cond {
    int c, x, y;
    bool tg;
    inline void read (){
        io::read (c), io::read (x), io::read (y);
        -- x, -- y;
        tg = io::read () ^ 1;
    }
} ce[M + 5];

vector < int > cd[M + 5];
vector < pair < int , int > > to[1 << N];

int col[14], tc[120000][14], cnt;
queue < int > Q;
inline bool Col (int s, int t){
    for (int i = 0;i < n;++ i){
        if (t >> i & 1)
            Q.push (i);
        col[i] = 0;
    }
    int ct = 0;
    for (int i = 0;i < n;++ i)
        if (s >> i & 1){
            ++ ct;
            int j = Q.front ();
            Q.pop ();
            for (int k = min (i, j);k <= max (i, j);++ k){
                if (col[k])
                    return false;
                col[k] = ct;
            }
        }
    for (int i = 0;i < n;++ i)
        if (! col[i])
            return false;
    return true;
}

void INIT (int s, int x, int t){
    if (x == n){
        if (Col (s, t)){
            // printf ("[%d %d]\n", s, t);
            to[s].push_back (make_pair (t, ++ cnt));
            for (int i = 0;i < n;++ i)
                tc[cnt][i] = col[i];
        }
        return ;
    }
    if (s >> x & 1){
        INIT (s, x + 1, t | (1 << x));
        for (int i = x + 1;i < n && ! (s >> i & 1);++ i)
            INIT (s, i + 1, t | (1 << i));
    } else {
        for (int i = x + 1;i < n;++ i)
            if (s >> i & 1){
                INIT (s, i + 1, t | (1 << x));
                break;
            }
    }
}
int f[2][1 << N];

inline void MOD (int &x){
    x >= mod && (x = x - mod);
}

signed main (){
    GET_START

    io::read (n), io::read (m), io::read (r);
    for (int i = 1;i <= r;++ i){
        ce[i].read ();
        cd[ce[i].c].push_back (i);
    }
    for (int i = 0;i < (1 << n);++ i)
        INIT (i, 0, 0);
    
    f[1][(1 << n) - 1] = 1;
    for (int i = 2, r = 1, w = 0;i <= m;++ i, r ^= 1, w ^= 1){
        for (int j = 0;j < (1 << n);++ j)
            f[w][j] = 0;
        for (int j = 0;j < n;++ j)
            for (int k = 0;k < (1 << n);++ k)
                if (! (k >> j & 1))
                    MOD (f[r][k] += f[r][k ^ (1 << j)]);
        for (int j = 0;j < (1 << n);++ j)
            if (f[r][j]){
                int k, rp;
                for (auto x : to[j]){
                    tie (k, rp) = x;
                    for (int p : cd[i])
                        if (ce[p].tg != (tc[rp][ce[p].x] == tc[rp][ce[p].y]))
                            goto eend;
                    MOD (f[w][k] += f[r][j]);
                    eend : ;
                }
            }
    }
    int ans = 0;
    for (int i = 0;i < (1 << n);++ i)
        MOD (ans += f[m & 1][i]);
    io::write (ans), puts ("");

    GET_END
    return 0;
}