#include <iostream>
#include <vector>
#include <atcoder/modint>
#include <atcoder/convolution>

using namespace std;
using namespace atcoder;
using mint = modint998244353;
int pre[2010],s[2010],a[2010],b[2010];
vector<mint> dp[2010],sum[2010];
vector<mint> f[2010];
vector<int> pos[2010];
int main(){
    int i,j,n,m,k; cin >> n >> m >> k;
    for(i=0;i<m;i++) pos[i].push_back(0);
    for(i=1;i<=n;i++){
        cin >> s[i]; s[i]--;
        pre[i] = pos[s[i]].back();
        pos[s[i]].push_back(i);
    }
    for(i=0;i<m;i++) cin >> a[i];
    for(i=0;i<m;i++) cin >> b[i];
    for(i=0;i<m;i++){
        if(a[i]>b[i]) swap(a[i],b[i]);
        f[i].resize(b[i] + 1);
        f[i][a[i]]++; f[i][b[i]]++;
    }
    for(i=0;i<=n + 1;i++) sum[i].resize(k + 1);
    dp[0] = {1};
    sum[0][0] = 0; sum[1][0] = 1;
    for(i=1;i<=n;i++){
        vector<mint> F(k + 1);
        for(j=0;j<=k;j++){
            F[j] = sum[i][j] - sum[pre[i]][j];
        }
        dp[i] = convolution(F,f[s[i]]);
        dp[i].resize(k + 1);
        for(j=0;j<=k;j++) sum[i + 1][j] = sum[i][j] + dp[i][j];
    }
    mint ans = 0;
    for(i=1;i<=n;i++) ans += dp[i][k];
    cout << ans.val() << "\n";
    // for(i=0;i<=n;i++){
    //     for(j=0;j<=k;j++){
    //         cout << dp[i][j].val() << "x^" << j;
    //         if(j<k) cout << "+";
    //     }
    //     cout << "\n";
    // }
    // for(i=1;i<=n;i++) cout << pre[i] << " ";
    // cout << "\n";
}