//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,abm,popcnt,mmx")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;
typedef long double ldb;
typedef complex<double> cd;

constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 998'244'353;
constexpr db PI = acos(-1);
constexpr bool IS_FILE = false, IS_TEST_CASES = false;

random_device rd;
mt19937 rnd32(rd());
mt19937_64 rnd64(rd());

template<typename T>
bool assign_max(T& a, T b) {
	if (b > a) {
		a = b;
		return true;
	}
	return false;
}

template<typename T>
bool assign_min(T& a, T b) {
	if (b < a) {
		a = b;
		return true;
	}
	return false;
}

template<typename T>
T square(T a) {
	return a * a;
}

template<>
struct std::hash<pair<ll, ll>> {
	ll operator() (pair<ll, ll> p) const {
		return ((__int128)p.first * MOD + p.second) % INF64;
	}
};

void solve() {
	ll n;
	cin >> n;
	vector<ll> a(n), b(n);
	for (ll i = 0; i < n; i++) {
		cin >> a[i];
	}
	for (ll i = 0; i < n; i++) {
		cin >> b[i];
	}
	sort(a.begin(), a.end());
	sort(b.begin(), b.end());
	ll q;
	cin >> q;
	vector<pair<ll, ll>> qs(q);
	vector<ll> add(n + 1, 0), dec(n + 1, 0);
	for (ll i = 0; i < q; i++) {
		cin >> qs[i].first >> qs[i].second;
		add[qs[i].first]++;
		dec[qs[i].second]++;
	}
	vector<ll> all(n + 1, 0);
	ll sum = 0;
	for (ll i = 0; i <= n; i++) {
		sum += add[i];
		if (sum == 0) {
			continue;
		}
		vector<ll> dp(i + 1, 0);
		dp[0] = 1;
		for (ll j = 0; j < n; j++) {
			vector<ll> ndp(i + 1, 0);
			for (ll k = 0; k <= min(i, j); k++) {
				ll ost = j - k;
				if (i + ost < n && a[j] <= b[i + ost]) {
					ndp[k] += dp[k];
					if (ndp[k] >= MOD) {
						ndp[k] -= MOD;
					}
				}
				if (k < i && a[j] > b[k]) {
					ndp[k + 1] += dp[k];
					if (ndp[k + 1] >= MOD) {
						ndp[k + 1] %= MOD;
					}
				}
			}
			swap(dp, ndp);
		}
		all[i] = dp.back();
		sum -= dec[i];
	}
	vector<ll> pref(1, 0);
	for (ll i = 0; i <= n; i++) {
		pref.push_back(pref.back() + all[i]);
	}
	for (ll i = 0; i < q; i++) {
		cout << (pref[qs[i].second + 1] - pref[qs[i].first]) % MOD << '\n';
	}
}

int main() {
	if (IS_FILE) {
		freopen("", "r", stdin);
		freopen("", "w", stdout);
	}
    	ios_base::sync_with_stdio(false);
    	cin.tie(0);
    	cout.tie(0);
	ll t = 1;
	if (IS_TEST_CASES) {
		cin >> t;
	}
	for (ll i = 0; i < t; i++) {
		solve();
	}
}