#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

using A = array<mint, 2010>;
A acc[2010];

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m, k;
  cin >> n >> m >> k;
  VI s(n);
  rep(i, n) cin >> s[i], s[i]--;
  VI a(m), b(m);
  rep(i, m) cin >> a[i];
  rep(i, m) cin >> b[i];
  A now;
  now[0] = 1;
  VI last(m, -1);
  rep(i, n) {
    acc[i + 1] = now;
    A p = now;
    int c = s[i];
    int j = last[c] + 1;
    rep(i, 2010) p[i] -= acc[j][i];
    A dp;
    rep(i, 2010 - a[c]) dp[i + a[c]] += p[i];
    rep(i, 2010 - b[c]) dp[i + b[c]] += p[i];
    rep(i, 2010) now[i] += dp[i];
    last[c] = i;
  }
  mint ans = now[k];
  cout << ans.val() << '\n';
}