#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
int main(){
  int N, M, K;
  cin >> N >> M >> K;
  vector<int> S(N);
  for (int i = 0; i < N; i++){
    cin >> S[i];
    S[i]--;
  }
  vector<int> A(M);
  for (int i = 0; i < M; i++){
    cin >> A[i];
  }
  vector<int> B(M);
  for (int i = 0; i < M; i++){
    cin >> B[i];
  }
  vector<vector<long long>> dp(M, vector<long long>(K + 1, 0));
  vector<vector<long long>> sum(N + 1, vector<long long>(K + 1, 0));
  sum[0][0] = 1;
  for (int i = 0; i < N; i++){
    for (int j = 0; j <= K; j++){
      sum[i + 1][j] = sum[i][j] + MOD - dp[S[i]][j];
      sum[i + 1][j] %= MOD;
    }
    dp[S[i]] = vector<long long>(K + 1, 0);
    for (int j = 0; j <= K; j++){
      if (j + A[S[i]] <= K){
        dp[S[i]][j + A[S[i]]] += sum[i][j];
        dp[S[i]][j + A[S[i]]] %= MOD;
      }
      if (j + B[S[i]] <= K){
        dp[S[i]][j + B[S[i]]] += sum[i][j];
        dp[S[i]][j + B[S[i]]] %= MOD;
      }
    }
    for (int j = 0; j <= K; j++){
      sum[i + 1][j] += dp[S[i]][j];
      sum[i + 1][j] %= MOD;
    }
  }
  cout << sum[N][K] << endl;
}