#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }

#include <atcoder/modint>
using mint = atcoder::modint998244353;

int main() {
    int N, M, K;
    cin >> N >> M >> K;
    vector<int> S(N), A(M), B(M);
    for (auto &x : S) cin >> x, --x;
    for (auto &x : A) cin >> x;
    for (auto &x : B) cin >> x;

    vector<mint> dpall(K + 1), dpsnxt(K + 1);
    dpall.at(0) = 1;
    vector dp(M, vector<mint>(K + 1));

    for (const int s : S) {
        const int a = A.at(s), b = B.at(s);

        for (int k = 0; k <= K; ++k) {
            if (k + a <= K) dpsnxt.at(k + a) += dpall.at(k) + dp.at(s).at(k);
            if (k + b <= K) dpsnxt.at(k + b) += dpall.at(k) + dp.at(s).at(k);
            dp.at(s).at(k) = -dpall.at(k);
            dpall.at(k) += dpsnxt.at(k);
            dpsnxt.at(k) = 0;
        }
    }
    cout << dpall.back().val() << '\n';
}