#include <bits/stdc++.h>


using namespace std;

using ll = long long;
using ld = long double;

#define len(a) ((int)(a).size())
#define rep(i, n) for(int i = 0; i < (n); i += 1)


mt19937 rnd(234);

const ll MOD = 998244353, SZ = 210, GR_SZ = 100'100;
ll bpow(ll a, ll p) {
    if (p == 0) return 1ll;
    if (p % 2) return (bpow(a, p - 1) * a) % MOD;
    ll b = bpow(a, p / 2);
    return (b * b) % MOD;
}
ll det(vector<vector<ll>>& matr) {
    int s = matr.size();

    ll det = 1;
    for (int i = 0; i < s; ++i) {
        int ind = -1;
        for (int j = i; j < s; ++j) {
            if (matr[j][i] != 0) {
                ind = j;
                break;
            }
        }
        if (ind == -1) return 0;
        if (i != ind) {
            matr[i].swap(matr[ind]);
            det *= bpow(MOD - 1, MOD - 2);
            det %= MOD;
        }

        ll rv = bpow(matr[i][i], MOD - 2);
        det *= matr[i][i];
        det %= MOD;
        for (int t = 0; t < s; ++t) {
            matr[i][t] *= rv;
            matr[i][t] %= MOD;
        }

        for (int j = i + 1; j < s; ++j) {
            ll mul = matr[j][i];
            for (int t = 0; t < s; ++t) {
                matr[j][t] -= matr[i][t] * mul % MOD;
                if (matr[j][t] < 0) matr[j][t] += MOD;
            }
        }
    }

    /*for (int i = 0; i < s; ++i) {
        for (int j = 0; j < s; ++j) {
            cerr << matr[i][j] << " ";
        }
        cerr << endl;
    }*/
    return det;
}

int n, m, l, k;

map<pair<int, int>, int> ins, outs;
vector<int> gr[GR_SZ];
int lst = 0, used[GR_SZ], t = 1;
vector<int> tpsrt;
int dp[GR_SZ];

void tps(int v) {
    used[v] = t;

    for (auto to : gr[v]) {
        if (used[to] != t) {
            tps(to);
        }
    }

    tpsrt.push_back(v);
}

int32_t main() {
    if (1) {
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    }

    cin >> n >> m >> l >> k;

    vector<pair<int, int>> starts(l), ends(l);
    vector<int> sts, nds;
    for (int i = 0; i < l; ++i) {
        cin >> starts[i].second;
        --starts[i].second;
        starts[i].first = 0;
    }
    for (int i = 0; i < l; ++i) {
        cin >> ends[i].second;
        --ends[i].second;
        ends[i].first = n - 1;
    }

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            ++lst;
            ins[{i, j}] = outs[{i, j}] = lst;
        }
    }

    set<pair<int, int>> bad;

    for (int i = 0; i < k; ++i) {
        int x, y;
        cin >> x >> y;
        --x; --y;
        bad.insert({ x, y });
        ++lst;
        outs[{x, y}] = lst;
        ++lst;
        outs[{x, y + 1}] = lst;

        gr[ins[{x, y}]].push_back({ outs[{x, y}] });

        //cerr << i << " in: " << lst + 1 << endl;
        ++lst;
        gr[ins[{x, y}]].push_back(lst);
        gr[ins[{x, y + 1}]].push_back(lst);
        nds.push_back(lst);
        //cerr << i << " out: " << lst + 1 << endl;
        ++lst;
        gr[lst].push_back(outs[{x, y}]);
        gr[lst].push_back(outs[{x, y + 1}]);
        sts.push_back(lst);
    }

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            ++lst;
            if (i + 1 < n) gr[outs[{i, j}]].push_back(ins[{i + 1, j}]);
            if (j + 1 < m && !bad.count({ i, j })) gr[outs[{i, j}]].push_back(ins[{i, j + 1}]);
        }
    }

    /*cerr << "GRAPH: " << endl;
    for (int v = 0; v < 14; ++v) {
        for (auto to : gr[v]) {
            cerr << v << " " << to << endl;
        }
    }*/

    for (auto c : starts) sts.push_back(ins[c]);
    for (auto c : ends) nds.push_back(outs[c]);

    vector<vector<ll>> matr(sts.size(), vector<ll>(nds.size()));

    /*for (auto c : sts) cerr << c << " ";
    cerr << endl;
    for (auto c : nds) cerr << c << " ";
    cerr << endl;*/

    for (int i = 0; auto c : sts) {
        ++t;
        tpsrt.clear();
        tps(c);
        reverse(tpsrt.begin(), tpsrt.end());
        for (int i = 0; i < GR_SZ; ++i) dp[i] = 0;
        dp[c] = 1;
        /*if (c == 8) {
            cerr << "TPS: " << tpsrt.size() << " " << c << endl;
            for (auto c : tpsrt) cerr << c << " ";
            cerr << endl;
        }*/
        for (auto v : tpsrt) {
            for (auto to : gr[v]) {
                dp[to] += dp[v];
                if (dp[to] >= MOD) dp[to] -= MOD;
            }
        }
        for (int j = 0; auto e : nds) {
            //if (i == 0) cerr << "Here" << e << " " << dp[e] << endl;
            matr[i][j] = dp[e];
            ++j;
        }
        ++i;
    }

    /*cerr << "Matr: " << endl;
    for (auto c : matr) {
        for (auto cc : c) cerr << cc << " ";
        cerr << endl;
    }
    cerr << "det: " << endl;*/

    cout << det(matr) << "\n";

    return 0;
}