#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int n, m, l; cin >> n >> m >> l;
vector<mint>a(n + 1);
rep(i, m) {
int x; cin >> x;
a[x] = (mint(m)).inv();
}
vector<bool>ng(n + 1);
rep(i, l) {
int x; cin >> x;
ng[x] = true;
}
vector<mint>dp(n + 1);
dp[0] = 1;
auto dfs = [&](auto &&self, int l, int r)->void {
if (l + 1 == r) {
if (ng[l])dp[l] = 0;
return;
}
int m = (l + r) / 2;
self(self, l, m);
vector<mint>f(m - l);
rep(i, m - l)f[i] = dp[i + l];
vector<mint>g(r - l);
rep(i, r - l)g[i] = a[i];
if (r == n + 1)g = a;
auto h = convolution(f, g);
if (r == n + 1) {
rep(i, h.size()) {
int x = i + l;
if (x >= m)dp[min(n, x)] += h[i];
}
}
else {
rep2(i, m, r)if (!ng[i])dp[i] += h[i - l];
}
self(self, m, r);
};
dfs(dfs, 0, n + 1);
cout << dp[n].val() << endl;
return 0;
}