#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <array>

using namespace std;
typedef long long ll;
#define fi first
#define se second
const ll mod=998244353;
int n,m,k;
ll dp[505][1<<14];
int con[505][15][15];

int col;
ll ways;
int sz=0;
int pos_t[15];
bool can[15][15];
int mn[15],mx[15];

void exh(int id, int mk, int done){
    vector<array<int, 3>> v;
    v.push_back({id, mk, done});
    while(!v.empty()){
        auto [id, mk, done] = v.back();
        v.pop_back();
        int new_id, new_mk, new_done;
        if(id == 0){
            if(done == 0){
                dp[col][mk] += ways;
            }
            continue;
        }
        if(done!=pos_t[id]+1){
            if(can[pos_t[id]][done-1]){
                new_id = id - 1;
                new_mk = mk|(1<<(done-1));
                new_done = pos_t[id];
                v.push_back({new_id, new_mk, new_done});
            }
        }
        else{
            for(int i=pos_t[id]; i>pos_t[id-1] ;i--){
                if(can[i][pos_t[id]]){
                    new_id = id - 1;
                    new_mk = mk|(1<<i);
                    new_done = i;
                    v.push_back({new_id, new_mk, new_done});
                }
            }
        }
    }
}

void exh2(int id,int mk,int done){
	if(id==0){
		if(done==0){
			dp[col][mk]+=ways;
		}
		return;
	}
	if(done!=pos_t[id]+1){
		if(can[pos_t[id]][done-1]) exh2(id-1,mk|(1<<(done-1)),pos_t[id]);
		return;
	}
	for(int i=pos_t[id]; i>pos_t[id-1] ;i--){
		if(can[i][pos_t[id]]) exh2(id-1,mk|(1<<i),i);
	}
}
int main(){
	ios::sync_with_stdio(false);
	cin >> n >> m >> k;
	for(int i=1; i<=k ;i++){
		int c,x,y,diff;cin >> c >> x >> y >> diff;
		x--;y--;
		diff++;
		if(con[c][x][y]+diff==3) return cout << "0\n",0;
		if(c==1 && diff==1) return cout << "0\n",0;
		con[c][x][y]|=diff;
	}
	dp[1][(1<<n)-1]=1;
	for(int r=1; r<m ;r++){
		for(int i=0; i<n ;i++){
			for(int j=i; j<n ;j++){
				can[i][j]=true;
			}
		}
		for(int i=0; i<n ;i++){
			int b1=i;
			int b2=n;
			for(int j=i; j<n ;j++){
				if(con[r+1][i][j]==1) b1=max(b1,j);
				if(con[r+1][i][j]==2) b2=min(b2,j);
			}
			if(b1!=i){
				int j=b1;
				if(con[r+1][i][j]==1){//same constraint
					for(int l=0; l<=i ;l++){
						for(int r=i; r<j ;r++){
							can[l][r]=false;
						}
					}
				}
			}
			if(b2!=n){//diff constraint
				int j=b2;
				for(int l=0; l<=i ;l++){
					for(int r=j; r<n ;r++){
						can[l][r]=false;
					}
				}
			}
		}/*
		for(int i=0; i<n ;i++){
			for(int j=i; j<n ;j++){
				cout << can[i][j] << ' ';
			}
		}
		cout << endl;*/
		for(int i=0; i<n ;i++){
			for(int j=0; j<(1<<n) ;j++){
				if((j>>i)&1) dp[r][j^(1<<i)]=(dp[r][j^(1<<i)]+dp[r][j]);
			}
		}
		
		for(int j=0; j<(1<<n) ;j++){
			dp[r][j]%=mod;
		}
		col=r+1;
		for(int j=1; j<(1<<n) ;j++){
			ways=dp[r][j];
			if(ways==0) continue;
			sz=0;
			pos_t[0]=-1;
			for(int i=0; i<n ;i++){
				if((j>>i)&1) pos_t[++sz]=i;
			}
			exh(sz,0,n);
		}
		for(int j=1; j<(1<<n) ;j++){
			dp[r+1][j]%=mod;
		}
	}
	ll ans=0;
	for(int j=1; j<(1<<n) ;j++) ans=(ans+dp[m][j])%mod;
	cout << ans << '\n';
}