openol D 100

#include <bits/stdc++.h>
// tiom4eg's precompiler options
// POGGERS POGGERS POGGERS POGGERS POGGERS POGGERS POGGERS
// IO settings
#define fastIO ios_base::sync_with_stdio(false); cin.tie(0)
// Quick types
#define ll long long
#define ld long double
//#define ull unsigned long long
#define pii pair <int, int>
#define vi vector <int>
#define mi vector <vector <int>>
// Quick functions
#define endl "\n"
#define F first
#define S second
#define all(a) a.begin(), a.end()
#define sz(a) (int)(a.size())
#define pb push_back
#define mp make_pair
// Quick fors
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORS(i, a, b, c) for (int i = a; i < b; i += c)
#define RFOR(i, a, b) for (int i = a; i >= b; --i)
#define EACH(e, a) for (auto& e : a)
// Pragmas
#ifndef TIOM4EG
#pragma GCC optimize("O3") // let the chaos begin!
#pragma GCC target("avx,avx2,tune=native")
#pragma GCC comment(linker, "/stack:200000000")
#endif
// PBDS
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pbds tree <int, null_type, less <int>, rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
// POGGERS POGGERS POGGERS POGGERS POGGERS POGGERS POGGERS
using namespace std;
mt19937 rng(chrono::duration_cast<chrono::milliseconds>(chrono::system_clock::now().time_since_epoch()).count());
#define int long long
constexpr int INF = 1e9 + 7, MD = 998244353, MAX = 200007, LG = 19, R = 1 << LG, MOD = 1000000007, MOD2 = 1e9 + 9, B = 256;
const ll INFLL = 1e18 + 7;


signed main() {
    fastIO;
    int n, t, s; cin >> n >> t >> s;
    vi a(n);
    EACH(e, a) cin >> e;
    function <int(int)> f = [&](int x) { return x >= t ? 0 : (t - x + s - 1) / s; };
    map <int, int> c, p, l, r;
    EACH(e, a) ++c[f(e)];
    for (auto it = c.begin(); it != c.end(); ++it) {
        p[it->F] = it->S;
        if (it != c.begin()) p[it->F] += p[prev(it)->F];
    }
    // min
    for (auto it = c.begin(); it != c.end(); ++it) {
        if (it == c.begin()) l[it->F] = 0;
        else l[it->F] = l[prev(it)->F] + min(it->F - prev(it)->F, p[prev(it)->F] - l[prev(it)->F]);
    }
    // max
    RFOR(i, n - 1, 0) {
        int cf = f(a[i]);
        int delay = n - 1 - i - l[cf];
        r[a[i]] = a.end() - lower_bound(all(a), t - s * (cf + delay)) - 1;
    }
    int q; cin >> q;
    while (q--) {
        int d, i; cin >> d >> i, --i;
        cout << (l[f(d)] <= i && i <= r[d] ? "Yes\n" : "No\n");
    }
}