#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using vi=vector<int>;
using vl=vector<ll>;
#define pb push_back
#define eb emplace_back
#define all(a) begin(a),end(a)

const int N=300010,MOD=998244353;
const char en='\n';
const ll LLINF=1ll<<60;

void ad(int&a,int b)
{
	a+=b;
	if (a>=MOD) a-=MOD;
}

int n,m,r,dp[2][(1<<14)+10];
vector<pair<int,vi>> imb[N];
vector<pair<int,string>> trans[N];
vector<pair<pii,int>> potr[N];

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin>>n>>m>>r;
	for (int b=0;b<(1<<n);++b)
	{
		vi iis;
		for (int i=0;i<n;++i) if ((b>>i)&1) iis.pb(i);
		imb[iis.size()].pb({b,iis});
	}
	for (int cuts=0;cuts<(1<<(n-1));++cuts)
	{
		vi gd;
		gd.pb(0);
		string s="a";
		for (int i=0;i<n-1;++i) if ((cuts>>i)&1) gd.pb(i+1),s.pb(s.back()+1);
		else s.pb(s.back());
		gd.pb(n);
		vi ko;
		for (int i=0;i<(int)gd.size()-1;++i) if (gd[i+1]-gd[i]>1) ko.pb(i);
		for (int b=0;b<(1<<ko.size());++b)
		{
			int b1=0,b2=0,cuu=0;
			for (int i=0;i<(int)gd.size()-1;++i)
			{
				if (gd[i+1]==gd[i]+1) b1+=1<<gd[i],b2+=1<<gd[i];
				else
				{
					if ((b>>cuu)&1) b1+=1<<gd[i],b2+=1<<(gd[i+1]-1);
					else b1+=1<<(gd[i+1]-1),b2+=1<<gd[i];
					++cuu;
				}
			}
			//cout<<s<<' '<<b1<<' '<<b2<<endl;
			trans[b2].pb({b1,s});
		}
	}
	bool od0=0;
	while (r--)
	{
		int c,x,y,di;
		cin>>c>>x>>y>>di;
		if (c==1)
		{
			if (di==0) od0=1;
			continue;
		}
		--c;
		--x;
		--y;
		potr[c].pb({{x,y},di});
	}
	if (od0)
	{
		cout<<0<<en;
		exit(0);
	}
	dp[0][(1<<n)-1]=1;
	for (int i=1;i<m;++i)
	{
		int pro=(i-1)%2,ne=i%2;
		for (int j=0;j<n;++j) for (int b=0;b<(1<<n);++b) if ((b>>j)&1) ad(dp[pro][b^(1<<j)],dp[pro][b]);
		//for (int b=0;b<(1<<n);++b) cout<<b<<' '<<dp[pro][b]<<en;
		for (int b=0;b<(1<<n);++b)
		{
			dp[ne][b]=0;
			for (auto x: trans[b])
			{
				bool ok=1;
				for (auto y: potr[i]) if ((x.y[y.x.x]!=x.y[y.x.y])!=y.y) ok=0;
				if (ok) ad(dp[ne][b],dp[pro][x.x]);
				//cout<<b<<' '<<x.x<<' '<<x.y<<en;
			}
			//cout<<i<<' '<<b<<' '<<dp[ne][b]<<en;
		}
	}
	int s=0;
	for (int i=0;i<(1<<n);++i) ad(s,dp[(m-1)%2][i]);
	cout<<s<<en;
}