// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
//#define int long long
#define ull unsigned long long
#define SZ(x) ((int)((x).size()))
#define ALL(x) (x).begin(),(x).end()
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define mod 998244353
struct modint{
	unsigned int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x<o.x?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,modint b){return a.x==b.x;}
	friend bool operator !=(modint a,modint b){return a.x!=b.x;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 455
#define inf 0x3f3f3f3f

int n,m,k;
int a[maxn],c1[maxn];
struct node{
	int l,r,c;
}t[maxn];

int cto[maxn];
int b[maxn];

set<vi>S;
void brute(){
//	For(i,1,k) cout<<cto[i]<<" "; cout<<"cto\n";
	For(i,1,n) b[i]=a[i];
	For(i,1,k) {
		For(j,t[i].l,t[i].r)
			b[j]=max(b[j],cto[i]);
	}
	//For(i,1,n) cout<<b[i]<<" "; cout<<" b\n";
	vi o;
	For(i,1,n) o.pb(b[i]);
	S.insert(o);
}

int tmp[maxn],len;
modint f[maxn][maxn],g[maxn][maxn];

vi buc[maxn];

int c[maxn],vis[maxn];
ull dp[maxn];

int ff[maxn];
int gf(int x){
	while(x!=ff[x])x=ff[x]=ff[ff[x]];
	return x;
}

int mns;
void del(int l,int r){
	for(int u=gf(l);u<=r;u=gf(u+1)) c[u]=1,ff[u]=u+1,mns=min(mns,u);
}

vi qs[maxn];

signed main()
{
//	freopen("data.in","r",stdin);
	n=read(),m=read(),k=read();
	For(i,1,n)a[i]=read();
	For(i,1,m)c1[i]=read();
	For(i,1,k){
		t[i].l=read(),t[i].r=read(),t[i].c=read();
		For(j,t[i].l,t[i].r) a[j]=max(a[j],t[i].c); 
	}
	sort(c1+1,c1+m+1);
	m=unique(c1+1,c1+m+1)-c1-1;
	
	For(i,1,n) a[i]=min(a[i],c1[1]);
	For(i,1,n) a[i]=max(a[i],c1[1]),assert(a[i]==c1[1]);
	// now a[i]=c1[1]!!
	
	int k2=0;
	For(i,1,k){
		if(t[i].c>c1[1]) t[++k2]=t[i];
	}k=k2;
	
	For(i,1,n) tmp[++len]=a[i];
	For(i,1,m) tmp[++len]=c1[i];
	For(i,1,k) tmp[++len]=t[i].c;
	sort(tmp+1,tmp+len+1),len=unique(tmp+1,tmp+len+1)-tmp-1;
	#define V(x) lower_bound(tmp+1,tmp+len+1,x)-tmp
	For(i,1,n) a[i]=V(a[i]);
	For(i,1,m) c1[i]=V(c1[i]);
	For(i,1,k) t[i].c=V(t[i].c);
	
	For(i,1,m) vis[c1[i]]=1;
	For(i,1,k){
		buc[t[i].c].pb(i);
		For(j,1,t[i].c-1) if(vis[j]) buc[j].pb(i);
	}
	
	For(l,1,n+1) f[l][l-1]=g[l][l-1]=1;
	Rep(i,len,1){
	//	cout<<"I: "<<tmp[i]<<"\n";
		For(l,0,n) For(r,l,n) g[l][r]=f[l][r],f[l][r]=0;
		For(l,1,n){
			
			c[l-1]=1;
			For(r,l,n+1) ff[r]=r,c[r]=0,qs[r].clear();
			for(int id:buc[i])
				if(l<=t[id].l) qs[t[id].r].pb(id);
			
			For(r,l,n){
				mns=r+1;
				for(int id:qs[r]) del(t[id].l,t[id].r);
			//	for(int id:qs[r]) 
			//		if(l<=t[id].l && t[id].r<=r) c[t[id].l]++,c[t[id].r+1]--;
			//	For(p,l+1,r+1) c[p]+=c[p-1];
			//	c[l-1]=1;
				
				c[r+1]+=1;
				For(p,mns,r+1) dp[p]=0;
				dp[l-1]=1;
				
				For(p,l-1,mns-1) if((c[p] || i==1) && dp[p]) {
					unsigned long long pp = (((unsigned __int128)dp[p] << 64) + mod - 1) / mod;
					For(q,mns,r+1) dp[q] += ((unsigned)g[p+1][q-1].x * pp * (unsigned __int128)mod >> 64);
				}
				For(p,mns,r+1) if((c[p] || i==1) && dp[p]) {
					dp[p]%=mod;
					unsigned long long pp = (((unsigned __int128)dp[p] << 64) + mod - 1) / mod;
					For(q,p+1,r+1)
						dp[q] += ((unsigned)g[p+1][q-1].x * pp * (unsigned __int128)mod >> 64);
				}
				
//				For(p,l-1,r) if((c[p] || i==1) && dp[p]) {
//					dp[p]%=mod;
//					unsigned long long pp = (((unsigned __int128)dp[p] << 64) + mod - 1) / mod;
//					For(q,p+1,r+1)
//						dp[q] += ((unsigned)g[p+1][q-1].x * pp * (unsigned __int128)mod >> 64);
//						//dp[q]%=mod;
//				}
				c[r+1]-=1;
				dp[r+1]%=mod;
				f[l][r]=dp[r+1];
			}
		}
			
//		For(l,1,n){
//			For(r,l,n){
//				cout<<f[l][r].x<<" ";
//			}cout<<"\n";
//		}
	}
	cout<<f[1][n].x;
	return 0;
}