#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(int)a;i<(int)b;i++)
using ll =long long;

struct mm {
    static constexpr ll mod = 998244353;
    ll x = 0;
    mm(ll x_ = 0): x{x_ % mod}{}
    friend mm operator+(mm a, mm b) { return a.x + b.x; }
    friend mm operator-(mm a, mm b) { return a.x - b.x; }
    friend mm operator*(mm a, mm b) { return a.x * b.x; }
    ll val() const {
        if(x < 0) return x + mod;
        return x;
    }
    mm& operator+=(mm b) { return *this = *this + b; }
    mm& operator-=(mm b) { return *this = *this - b; }
    mm& operator*=(mm b) { return *this = *this * b; }
};

void solve(){
    ll N,M,R;
    cin>>N>>M>>R;
    struct sta{
        int c;
        int x,y;
        int diff;
    };
    vector<vector<sta>> G(M);
    rep(i,0,R){
        sta tmp;
        cin>>tmp.c>>tmp.x>>tmp.y>>tmp.diff;
        tmp.c--;tmp.x--,tmp.y--;
        if(tmp.c==0&&tmp.diff==0){
            cout<<"0\n";
            return;
        }
        G[tmp.c].push_back(tmp);
    }
    if(N==1){
        cout<<"1\n";
        return;
    }
    vector<vector<pair<int,int>>> sen(1<<N);
    rep(i,0,1<<(N-1)){
        vector<int> p={0};
        rep(j,0,N) if(i&(1<<j)) p.push_back(j+1);
        p.push_back(N);
        int len=(int)(p.size())-1;
        int X=0;
        rep(i,0,len) if(p[i+1]-p[i]!=1) X++;
        rep(j,0,1<<X){
            int A=0,B=0,ind=0;
            rep(k,0,len){
                if(p[k+1]-p[k]==1){
                    A+=(1<<p[k]);
                    B+=(1<<p[k]);
                }
                else{
                    if(j&(1<<ind)){
                        A+=(1<<p[k]);
                        B+=(1<<(p[k+1]-1));
                    }
                    else{
                        A+=(1<<(p[k+1]-1));
                        B+=(1<<p[k]);
                    }
                    ind++;
                }
            }
            sen[A].push_back({B,i*2+1});
        }
    }
    vector<mm> dp(1<<N);
    dp[(1<<N)-1]=1;
    rep(col,1,M){
        vector<mm> n_dp(1<<N);
        rep(i,0,N) rep(j,0,1<<N){
            if(j&(1<<i)) dp[j-(1<<i)]+=dp[j];
        }
        rep(to,0,1<<N) for(auto po:sen[to]){
            bool ok=1;
            int fr,cl;
            tie(fr,cl)=po;
            for(auto tmp:G[col]){
                if((0!=(cl&((1<<(tmp.y+1)))-(1<<(tmp.x+1))))^(tmp.diff==1)){
                    ok=0;
                    break;
                }
            }
            if(ok) n_dp[fr]+=dp[to];
        }
        swap(n_dp,dp);
    }
    mm ans=0;
    for(auto x:dp) ans+=x;
    cout<<ans.val()<<"\n";
}
/*

3 5 3
3 2 3 0
4 1 2 0
5 1 3 0


19


5 10 10
9 3 4 1
2 4 5 0
7 2 3 0
9 2 3 0
6 3 5 0
6 2 4 1
2 4 5 0
1 1 3 1
7 2 4 0
10 2 3 0


1514


4 2 0


17
 */
int main(){
    solve();
}