//Challenge: Accepted
#include <bits/stdc++.h>
using namespace std;
void debug(){cout << endl;}
template<class T, class ... U> void debug(T a, U ... b) {cout << a << " ", debug(b...);}
template<class T> void pary(T l, T r) {
while (l != r) cout << *l << " ", l++;
cout << endl;
}
#define ll long long
#define maxn 100005
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
int a[maxn], b[maxn], to[maxn];
ll dis[maxn], cy[maxn];
bool vis[maxn];
vector<ll> ch[maxn];
pii s[maxn];
int main() {
io
int n, m, l, c;
cin >> n >> m >> l >> c;
for (int i = 0;i < n;i++) cin >> a[i], s[i] = {a[i], i};
for (int i = 0;i < m;i++) cin >> b[i];
sort(s, s + n);
for (int i = 0;i < n;i++) {
int pos =((s[i].ff - c)%l + l)%l;
int ind = upper_bound(s, s + n, make_pair(pos, maxn)) - s - 1;
if (ind < 0) ind = n - 1;
to[s[i].ss] = s[ind].ss;
dis[s[i].ss] = c + (pos - s[ind].ff + l)%l;
}
for (int i = 0;i < n;i++) {
for (int j = 0;j < n;j++) vis[j] = 0;
int cur = i;
ll d = 0;
do {
vis[cur] = 1;
d += dis[cur];
cur = to[cur];
} while (!vis[cur]);
if (cur == i) {
cy[i] = d;
}
}
for (int i = 0;i < m;i++) {
for (int j = 0;j < n;j++) vis[j] = 0;
int cur = upper_bound(s, s + n, make_pair(b[i], maxn)) - s - 1;
if (cur < 0) cur = n - 1;
ll d = (b[i] - s[cur].ff + l)%l;
do {
ch[cur].push_back(d);
vis[cur] = 1;
d += dis[cur];
cur = to[cur];
} while (!vis[cur]);
}
int q;
cin >> q;
for (int i = 0;i < q;i++) {
ll l, t;
cin >> l >> t;
l--;
ll ans = 0;
for (auto x:ch[l]) {
if (x > t) continue;
if (cy[l]) {
ans += (t - x) / cy[l] + 1;
} else {
ans++;
}
}
cout << ans << "\n";
}
}
