#include<bits/stdc++.h>

#define vc vector
#define pb emplace_back
#define pii pair<int, int>
#define mkp make_pair
#define rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define lep(i, a, b) for(int i = (a); i >= (b); --i)

using namespace std;

mt19937 gen(time(0));

inline int read() {
	int x = 0, w = 0; char ch = getchar(); while(!isdigit(ch)) w |= (ch == '-'), ch = getchar();
	while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar(); return w ? -x : x; 
}

const int N = 5005, MOD = 998244353;

// CALC
inline void inc (int &x, int y) { x += y - MOD; x += (x >> 31) & MOD; }
inline int qpow (int a, int b) { int res = 1; for(; b; b >>= 1, a = 1ll * a * a % MOD) if(b & 1) res = 1ll * res * a % MOD; return res; }
inline int qinv (int a) { return qpow(a, MOD - 2); }

struct mint {
	int x; 
	mint (int ix = 0) { x = ix % MOD; if(x < 0) x += MOD; }
	mint operator += (mint a) { inc (x, a.x); return a; }
	mint operator -= (mint a) { inc (x, MOD - a.x); return a; }
	mint operator *= (mint a) { x = 1ll * x * a.x % MOD; return a; }
	mint friend operator + (mint a, mint b) { a += b; return a; }
	mint friend operator - (mint a, mint b) { a -= b; return a; }
	mint friend operator * (mint a, mint b) { a *= b; return a; }
} ;  

int n, m, a[N], b[N];
mint ans[N], f[N][N];

inline mint calc (int t) {
	rep (i, 0, n) rep (j, 0, i) f[i][j] = 0;
	f[0][0] = 1;
	rep (i, 0, n - 1) rep (j, 0, min (i, t)) if (f[i][j].x) {
		if (a[i + 1] > b[j + 1]) f[i + 1][j + 1] += f[i][j];
		if (a[i + 1] < b[t + i - j + 1]) f[i + 1][j] += f[i][j];
	}
	return f[n][t];
}

signed main() {
	n = read ();
	rep (i, 1, n) a[i] = read ();
	rep (i, 1, n) b[i] = read ();
	sort (a + 1, a + 1 + n); sort (b + 1, b + 1 + n);
	
	rep (i, 0, n) ans[i + 1] = ans[i] + calc (i);
	
	m = read ();
	for (int i = 1, l, r; i <= m; i ++) {
		l = read (), r = read ();
		printf ("%d\n", (ans[r + 1] - ans[l]).x);
	}
	
	return 0;
}