#include <bits/stdc++.h>

using namespace std;
using ll = long long;

constexpr int MOD = 998244353;

void madd(int &x, int y) {
    if ((x += y) >= MOD) {
        x -= MOD;
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;

    vector<int> a(n), b(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    for (int i = 0; i < n; ++i) {
        cin >> b[i];
    }
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());

    int q;
    cin >> q;
    vector<pair<int, int>> queries(q);
    vector<int> need(n + 1);
    for (int i = 0; i < n; ++i) {
        cin >> queries[i].first >> queries[i].second;
        fill(need.begin() + queries[i].first, need.begin() + queries[i].second + 1, true);
    }

    vector<int> ans(n + 1);
    for (int k = 0; k <= n; ++k) {
        if (!need[k]) {
            continue;
        }
        vector<int> dp(k + 1);
        dp[0] = 1;
        for (int i = 0; i < n; ++i) {
            vector<int> nxt(k + 1);
            for (int c = 0; c <= min(k, i); ++c) {
                if (c + 1 <= k && b[c] < a[i]) {
                    madd(nxt[c + 1], dp[c]);
                }
                int j = k + (i - c);
                if (j < n && b[j] > a[i]) {
                    madd(nxt[c], dp[c]);
                }
            }
            swap(dp, nxt);
        }
        ans[k] = dp[k];
    }

    for (auto &[l, r] : queries) {
        int res = accumulate(ans.begin() + l, ans.begin() + r + 1, 0LL) % MOD;
        cout << res << '\n';
    }

    return 0;
}