#include<bits/stdc++.h>
using namespace std;
#define IOS {cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);}
#define rep(i,l,r) for(int i=(l); i<=(r); i++)
#define per(i,r,l) for(int i=(r); i>=(l); i--)
#define P pair<int,int>
#define ll long long
#define vi vector<int>
const int N=16,M=505,N2=1<<14,mod=998244353;
void add(int &x,int y){
    x+=y; if(x>=mod)x-=mod;
}
int n,m,Q,bad[M][N][N];
int top,q[N],cnt[N2],bs[N2][N];
vector<int>to[N2]; int cur;
void dfs(int i,int r,int s){
    if(i>top){
        if(r==n)to[cur].push_back(s);
        return;
    }
    if(q[i]==r+1){
        rep(k,q[i],q[i+1]-1)dfs(i+1,k,s|(1<<k-1));
    }
    else dfs(i+1,q[i],s|(1<<r));
}
int dp[M][N2];
signed main(){
    IOS
    cin>>n>>m>>Q;
    auto ok=[&](int l,int r,int x){
        return l<=x && x<=r;
    };
    rep(_,1,Q){
        int c,x,y,dif; cin>>c>>x>>y>>dif;
        if(dif==1){
            rep(l,1,n){
                rep(r,l,n){
                    if(l<=x && y<=r)bad[c][l][r]=1;
                }
            }
        }
        else{
            rep(l,1,n){
                rep(r,l,n){
                    if(ok(l,r,x) != ok(l,r,y))bad[c][l][r]=1;
                }
            }
        }
    }
    ll tot=0;
    rep(s,1,(1<<n)-1){
        top=0; cur=s;
        rep(j,0,n-1){
            if((1<<j)&s)q[++top]=j+1,bs[s][++cnt[s]]=j+1;
        }
        q[top+1]=n+1;
        dfs(1,0,0);
        // cout<<s<<": "; for(auto v:to[s])cout<<v<<" "; cout<<endl;
        tot+=to[s].size();
    }
    // cout<<tot<<endl; return 0;
    rep(s,1,(1<<n)-1)dp[m][s]=1;
    auto ck=[&](int i,int l,int r){
        if(l>r)swap(l,r);
        return bad[i][l][r];
    };
    per(i,m,2){
        rep(s,1,(1<<n)-1){
            for(auto s2:to[s]){
                // assert(cnt[s]==cnt[s2]);
                int fl=1;
                rep(k,1,cnt[s]){
                    // if(i==5 && s==1)cout<<"####"<<s<<" "<<s2<<" "<<bs[s][1]<<" "<<bs[s2][1]<<" "<<bad[5][1][3]<<endl;
                    if(ck(i,bs[s][k],bs[s2][k])){
                        fl=0;break;
                    }
                }
                // cout<<i<<" "<<s<<" "<<s2<<" "<<fl<<endl;
                if(fl){
                    add(dp[i-1][s],dp[i][s2]);
                    // cout<<i<<" "<<s<<" "<<s2<<" "<<endl;
                }
            }
        }
        // cout<<"col "<<i-1<<" :";
        // rep(s,1,(1<<n)-1)cout<<dp[i-1][s]<<" "; cout<<endl;
        // per(s,(1<<n)-1,1){
        //     rep(s2,1,s-1){
        //         if((s2&s)==s2)add(dp[i-1][s],dp[i-1][s2]);
        //     }
        // }
        rep(j,0,n-1){
            rep(s,1,(1<<n)-1){
                if(s&(1<<j))add(dp[i-1][s],dp[i-1][s-(1<<j)]);
            }
        }
    }
    cout<<dp[1][(1<<n)-1]<<"\n";
}
/*
3 5 3
3 2 3 0
4 1 2 0
5 1 3 0

1: 4 
2:
3: 5
4: 1
5: 3 6
6: 5
7: 7

n=14, tot=114243
*/