#include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define ll long long
using namespace std;
typedef pair<int,int> pii;

const int mod=998244353;
inline int add(int x,int y){int ret=x+y;if(ret>=mod)ret-=mod;return ret;}
inline int sub(int x,int y){int ret=x-y;if(ret<0)ret+=mod;return ret;}
inline int mul(int x,int y){return ((ll)x*y)%mod;}
inline int step(int base,int pw){int ret=1;while(pw){if(pw&1)ret=mul(ret,base);base=mul(base,base);pw>>=1;}return ret;}
inline int invv(int x){return step(x,mod-2);}

const int maxn=15;
const int maxm=510;
int n,pocstate,dp[1<<maxn],m,r;
vector<pair<int,pii>>states;
vector<int>mdp;

void prek_states(){

    for(int i=0;i<(1<<n);i++){

        if(i&1)continue;

        int prv=0;
        int prpos=0;
        int pp=1;
        vector<pii>ints;
        vector<pii>ps;
        for(int j=1;j<n;j++){
            int cb=1;
            if(i&(1<<j)){}
            else cb=0;
            if(prv==cb){

            }
            else{

                ints.pb({prpos,j-1});

                if(prpos+1==j){
                    ints.pop_back();
                    ps.pb({prpos,prpos});
                }
                else pp*=2;
                prpos=j;
            }
            prv=cb;
        }
        pp*=2;
        if(n-1!=prpos)ints.pb({prpos,n-1});
        else ps.pb({n-1,n-1});

        int cmask=0;
        for(int j=0;j<ps.size();j++)cmask|=(1<<ps[j].ff);
        for(int j=0;j<(1<<ints.size());j++){

            int mask=cmask;
            int rmask=cmask;
            for(int k=0;k<ints.size();k++){
                if(j&(1<<k)){
                    mask|=(1<<ints[k].ff);
                    rmask|=(1<<ints[k].ss);
                }
                else{
                    mask|=(1<<ints[k].ss);
                    rmask|=(1<<ints[k].ff);
                }
            }

            states.pb({i,{mask,rmask} });
        }
        ///printf("%d %d \n",i,pp);

        if(ps.size()==n){
            pocstate=states.size()-1;
        }

    }
    mdp.resize(states.size());

}


void calc_sos(){

    for(int j=0;j<(1<<n);j++)dp[j]=0;
    for(int i=0;i<states.size();i++)
        dp[states[i].ss.ff]=add(dp[states[i].ss.ff],mdp[i]);

    for(int i=0;i<n;i++)
        for(int j=0;j<(1<<n);j++)
        if(j&(1<<i)){}
        else{
            dp[j]=add(dp[j],dp[j|(1<<i)]);
        }

}
vector<pair<pii,int>>rules[maxm];
int checkmem[maxn][maxn][2][1<<maxn];
bool check(int x,int y,int diff,int mask){

    if(checkmem[x][y][diff][mask]!=-1)return checkmem[x][y][diff][mask];

    int &a=checkmem[x][y][diff][mask];
    a=1;

    int col1,col2;
    int cnt=0;
    int prv=-1;
    for(int j=0;j<n;j++){

        int cb=0;
        if(mask&(1<<j))cb=1;

        if(cb!=prv){
            cnt++;
        }
        if(x==j)col1=cnt;
        else if(y==j)col2=cnt;

        prv=cb;
    }

    if(diff==0){
        if(col1==col2)a=1;
        else a=0;
    }
    else{
        if(col1==col2)a=0;
        else a=1;
    }

    return a;
}
void filter(int col){

    //check(0,1,diff,states[j].ff)

    for(int i=0;i<rules[col].size();i++){
        int x=rules[col][i].ff.ff-1;
        int y=rules[col][i].ff.ss-1;
        int diff=rules[col][i].ss;

        for(int j=0;j<states.size();j++){

            if(check(x,y,diff,states[j].ff)){}
            else mdp[j]=0;

        }

    }

}

void prek_pstate(){

    mdp[pocstate]=1;
    filter(1);
    calc_sos();

}
void calc_mdp(){

    for(int i=0;i<states.size();i++){
        mdp[i]=dp[states[i].ss.ss];
    }

}

int main(){


    memset(checkmem,-1,sizeof(checkmem));

    ///freopen("test.txt","r",stdin);

    scanf("%d %d %d",&n,&m,&r);

    prek_states();


    for(int i=0;i<r;i++){
        int c,diff,x,y;
        scanf("%d %d %d %d",&c,&x,&y,&diff);
        rules[c].pb({ {x,y},diff });
    }

    prek_pstate();

    for(int i=2;i<=m;i++){

        calc_mdp();
        filter(i);
        calc_sos();
    }

    int rez=0;
    for(int i=0;i<states.size();i++)rez=add(rez,mdp[i]);
    printf("%d\n",rez);

    return 0;
}