#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using mint = modint998244353;
using vm = vector<mint>;
using vvm = vector<vm>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;

using vd = vector<double>;
using vvd = vector<vd>;
using vvvd = vector<vvd>;
#define rep(i,n) for(ll i=(ll)(0); i<(ll(n)); ++i)
#define all(x) (x).begin(), (x).end()

mint op(mint a, mint b) {
    return a + b;
};
mint e() { return 0; };

int main() {

    ll N, M, K;
    cin >> N >> M >> K;
    vll S(N);
    vll 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<segtree<mint, op, e>> seg(K + 1);
    rep(i, K + 1) {
        segtree<mint, op, e> SE(N + 1);
        seg[i] = SE;
    }
    seg[0].set(0, 1);
    vll L(M, 0);
    rep(i, N) {
        ll s = S[i];
        rep(k, K + 1) {
            mint d = seg[k].prod(L[s], i + 1);
            if (k + A[s] <= K) {
                mint e = seg[k + A[s]].get(i + 1);
                seg[k + A[s]].set(i + 1, d+e);
            }
            if (k + B[s] <= K) {
                mint e = seg[k + B[s]].get(i + 1);
                seg[k + B[s]].set(i + 1, d + e);
            }
        }
        L[s] = i+1;
    }
    mint an = seg[K].all_prod();
    cout << an.val() << endl;
}