#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <atcoder/modint>
using namespace std;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
const i64 INF = 1001001001001001001;

using Modint = atcoder::static_modint<998244353>;

int main(){
    int N, M, K; cin >> N >> M >> K;
    vector<int> S(N);
    vector<int> A(M), B(M);
    rep(i,N){ cin >> S[i]; S[i]--; }
    rep(i,M) cin >> A[i];
    rep(i,M) cin >> B[i];
    vector<vector<Modint>> dp(2, vector<Modint>(K+1));
    dp[1][0] = 1;
    auto x = Modint(2).inv();
    rep(i,N){
        int j = i-1;
        while(j >= 0 && S[j] != S[i]) j--;
        int a = A[S[i]];
        int b = B[S[i]];
        vector<Modint> tmp = dp.back();
        for(int q=a; q<=K; q++) tmp[q] += (dp[i+1][q-a] - dp[j+1][q-a]);
        for(int q=b; q<=K; q++) tmp[q] += (dp[i+1][q-b] - dp[j+1][q-b]);
        dp.push_back(move(tmp));
    }
    Modint ans = dp.back()[K];
    cout << ans.val() << endl;
    return 0;
}