/*
Things to notice:
1. do not calculate useless values
2. do not use similar names
 
Things to check:
1. submit the correct file
2. time (it is log^2 or log)
3. memory
4. prove your naive thoughts 
5. long long
6. corner case like n=0,1,inf or n=m
7. check if there is a mistake in the ds or other tools you use
8. fileio in some oi-contest

9. module on time 
10. the number of a same divisor in a math problem
11. multi-information and queries for dp and ds problems
*/
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
const int mod=998244353;
const int inf=0x3f3f3f3f;
//map <int,int> ma[1<<14];
//int tot=0,n=14;
//vector <int> pos;
//int st;
//void dfs(int idx,int mask,int len)
//{
//	if(idx==pos.size()) 
//	{
//		if(len!=n-1) return; 
//		cout<<mask<<" ";
//		tot++;
////		if(!ma[mask][st]) ma[mask][st]++,tot++;
//		return;
//	}
////	dfs(idx+1,mask,len);
//	if(len+1<pos[idx]) dfs(idx+1,mask|(1<<(len+1)),pos[idx]);
//	else
//	{
//		for(int j=len+1;j<n;j++) dfs(idx+1,mask|(1<<j),j);
//	}
//}
void add(int &x,int y)
{
	x+=y;
	if(x>=mod) x-=mod;
}
int dp[505][1<<14];
int g[15][1<<14],sum[1<<14];
int ok[505][14][14];
int n,m,Q;
int lb[1<<14][14];
void solve()
{
	
	cin>>n>>m>>Q;
	for(int c=1;c<=m;c++) for(int i=0;i<n;i++) for(int j=i;j<n;j++) ok[c][i][j]=1;
	while(Q--)
	{
		int c,x,y,d;
		cin>>c>>x>>y>>d;
		x--,y--;
		if(c==1&&d==0)
		{
			cout<<"0\n";
			return;
		}
		if(d==0)
		{
			for(int i=0;i<n;i++) for(int j=i;j<n;j++)
			{
				int t=0;
				if(i<=x&&x<=j) t++;
				if(i<=y&&y<=j) t++;
				if(t==1) ok[c][i][j]=0;
			}
		}
		else
		{
			for(int i=0;i<n;i++) for(int j=i;j<n;j++)
			{
				int t=0;
				if(i<=x&&x<=j) t++;
				if(i<=y&&y<=j) t++;
				if(t==2) ok[c][i][j]=0;
			}
		}
	}
	dp[1][(1<<n)-1]=1;
	memset(lb,-1,sizeof(lb));
	for(int i=1;i<(1<<n);i++) for(int len=0;len<n;len++) for(int j=len;j<n;j++) if(i&(1<<j)) 
	{
		lb[i][len]=j;
		break;
	}
//	cout<<"...... "<<ok[1][0][1]<<"\n";
	for(int i=2;i<=m;i++)
	{
		memset(sum,0,sizeof(sum));
		for(int mask=0;mask<(1<<n);mask++) sum[mask]=dp[i-1][mask];
		for(int j=0;j<n;j++) for(int mask=0;mask<(1<<n);mask++) if(!(mask&(1<<j))) add(sum[mask],sum[mask|(1<<j)]);
		memset(g,0,sizeof(g));
		for(int mask=1;mask<(1<<n);mask++) add(g[0][mask],sum[mask]);//,cout<<sum[mask]<<" ";
//		cout<<"\n";
		for(int len=-1;len+1<n;len++) for(int mask=0;mask<(1<<n);mask++) if(g[len+1][mask])
		{
//			cout<<len<<" "<<mask<<" "<<g[len+1][mask]<<"\n";
			int u=lb[mask][len+1];
			if(u==-1) continue;
			if(len+1<u)
			{
//				cout<<"--> "<<len+1<<" "<<u<<" "<<ok[i][len+1][u]<<"\n";
				if(!ok[i][len+1][u]) continue;
//				cout<<"ok\n";
				int mask2=mask^(1<<u);
				mask2|=(1<<(len+1));
				add(g[u+1][mask2],g[len+1][mask]);
			}
			else
			{
				int mask2=mask^(1<<u);
				for(int j=u;j<n;j++)
				{
					if(j!=u&&(mask&(1<<j))) break;
					if(!ok[i][u][j]) continue;
					add(g[j+1][mask2|(1<<j)],g[len+1][mask]);
				}
			}
		}
//		system("pause");
		for(int mask=0;mask<(1<<n);mask++) add(dp[i][mask],g[n][mask]);//,cout<<dp[i][mask]<<" ";
//		cout<<"\n";
	}
	int ans=0;
	for(int mask=0;mask<(1<<n);mask++) add(ans,dp[m][mask]);
	cout<<ans<<"\n";
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int _=1;
//	cin>>_;
	while(_--) solve();
	return 0;
}