#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (int i=(int)a;i<(int)b;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}



void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,0,t) solve();
}

void solve(){
	int N,M,K;
	cin>>N>>M>>K;
	vector<int> S(N),A(M),B(M);
	rep(i,0,N) cin>>S[i],S[i]--;
	rep(i,0,M) cin>>A[i];
	rep(i,0,M) cin>>B[i];
	vector dp(N+1,vector<ll>(K+1));
	map<int,int> m;
	dp[0][0]=1;
	auto add=[&](vector<ll> &a,vector<ll> b,int c,int s)->void{
		rep(i,0,b.size()){
			if(i+c<(int)a.size()) a[i+c]=(a[i+c]+b[i]*s)%mod;
		}
	};
	rep(i,0,N){
		auto tmp=dp[i];
		if(m.count(S[i])) add(tmp,dp[m[S[i]]],0,-1);
		m[S[i]]=i;
		add(dp[i+1],tmp,A[S[i]],1);
		add(dp[i+1],tmp,B[S[i]],1);
		add(dp[i+1],dp[i],0,1);
	}
	cout<<(dp[N][K]+mod)%mod<<"\n";
}