#include <cstdio>
#include <algorithm>
#include <bitset>

const int mod = 998244353;
using std::min; using std::max;
int f[155][155][155], g[155], crs[155][155][155], a[155], n, q1, q2, mn = 1e9;
bool vis[155], cov[155];
std::bitset<155> hav[155][155][155];

int main() {
	scanf("%d%d%d", &n, &q1, &q2);
	for (int i = 1; i <= n; ++ i) scanf("%d", a + i);
	for (int i = 1, x; i <= q1; ++ i) scanf("%d", &x), vis[x] = 1, mn = min(mn, x);
	for (int i = 1; i <= n; ++ i) a[i] = min(a[i], mn);
	for (int i = 0; i <= n; ++ i)
	for (int x = 0; x <= n + 1; ++ x) f[i + 1][i][x] = 1;
	for (int i = 1, l, r, x; i <= q2; ++ i)  {
		scanf("%d%d%d", &l, &r, &x);
		for (int j = l; j <= r; ++ j) crs[l][r][j] = max(crs[l][r][j], x), hav[l][r][j].set(x), cov[j] = 1;
	}
	for (int l = n; l; -- l)
	for (int r = l; r <= n; ++ r) {
		for (int k = l; k <= r; ++ k) {
			crs[l][r][k] = max(crs[l][r][k], max(crs[l + 1][r][k], crs[l][r - 1][k]));
			hav[l][r][k] |= hav[l + 1][r][k] | hav[l][r - 1][k];
		}
		for (int x = n; x; -- x) {
			g[l - 1] = 1;
			for (int i = l; i <= r; ++ i) {
				g[i] = 0;
				if ((mn <= x || !cov[i]) &&
				(a[i] <= x && (a[i] == x || (vis[x] && crs[l][r][i] >= x) || hav[l][r][i][x])))
					for (int j = l - 1; j < i; ++ j)
						g[i] = (g[i] + 1ll * g[j] * f[j + 1][i - 1][x + 1]) % mod;
			}
			for (int k = l; k <= r; ++ k)
				f[l][r][x] = (f[l][r][x] + 1ll * g[k] * f[k + 1][r][x + 1]) % mod;
			f[l][r][x] = (f[l][r][x] + f[l][r][x + 1]) % mod;
		}
	}
	printf("%d", f[1][n][1]);
	return 0;
}