#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <bitset>
#include <queue>
#include <stack>
#include <sstream>
#include <cstring>
#include <numeric>
#include <ctime>
#include <cassert>
#include <random>
//#include <valarray>
//#include <fstream>

#define re return
#define fi first
#define se second
#define mp make_pair
#define pb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) ((int)(x).size())
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; i--)
#define y0 y32479
#define y1 y95874
#define next next239
#define prev prev239
#define fill(x, y) memset(x, y, sizeof(x))
#define sqr(x) ((x)*(x))
#define sqrt(x) sqrt(abs(x))
#define unq(x) (x.resize(unique(all(x)) - x.begin()))
#define ba back()
#define popcount __builtin_popcountll
#define firstbit(x) (63 - __builtin_clzll(x))
#define fastIO() {ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);}

#ifdef LOCAL_BOBER
bool local = true;
#define deb(x) cout << #x << " = " << (x) << endl
#define debn(x, n) { cout << #x << "(" << n << ") = " << \
	"{"; int _f_ = 1; rep(_i_, n) {if (!_f_) cout << "|"; cout << x[_i_]; _f_= 0;} cout << "}" << endl;}
#define deba(x) { cout << #x << " (size: " << sz(x) << ") = " << \
	"{"; int _f_ = 1; for (auto o : x) {if (!_f_) cout << "|"; cout << o; _f_ = 0;} cout << "}" << endl;}
#else
bool local = false;
#define deb(x) ;
#define debn(x, n) ;
#define deba(x) ;
#define endl "\n"
#endif

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef pair<double, double> pdd;
typedef long double LD;
typedef double D;

template<class T> void print(T v) { cout << sz(v) << endl; for (auto x : v) cout << x << ' '; cout << endl; };
template<class T> void print1(T v) { cout << sz(v) << endl; for (auto x : v) cout << x + 1 << ' '; cout << endl; };
template<class T1, class T2> ostream& operator << (ostream &o, pair<T1, T2> x) {re o << x.fi << ' ' << x.se;}
template<class T1, class T2> istream& operator >> (istream &o, pair<T1, T2> &x) {re o >> x.fi >> x.se;}
template<class T> ostream& operator << (ostream &o, vector<T> &x) {for (auto &el : x) o << el << ' '; re o;}
template<class T> istream& operator >> (istream &o, vector<T> &x) {for (auto &el : x) o >> el; re o;}
template<class T1, class T2> pair<T1, T2> operator + (pair<T1, T2> a, pair<T1, T2> b) {a.fi += b.fi; a.se += b.se; re a;}
template<class T1, class T2> pair<T1, T2> operator - (pair<T1, T2> a, pair<T1, T2> b) {a.fi -= b.fi; a.se -= b.se; re a;}
template<class T1, class T2> void operator += (pair<T1, T2> &a, pair<T1, T2> b) {a.fi += b.fi; a.se += b.se;}
template<class T1, class T2> void operator -= (pair<T1, T2> &a, pair<T1, T2> b) {a.fi -= b.fi; a.se -= b.se;}

int nint() {int x; cin >> x; re x;}
double getTime() { re clock() / (double) CLOCKS_PER_SEC;};

mt19937 rnd(0);
int rand(int n) { re rnd() % n; }
int rand(int l, int r) { re rnd() % (r - l + 1) + l; }

const int mod = 1000000000 + 7;
//const int mod = 998244353;

void initIO() {
	if (local) {
		freopen("input.txt", "r", stdin);
		//freopen("output.txt", "w", stdout);
		srand((int)time(0));
		rnd.seed((int)time(0));
	}
	else {
		//freopen("input.txt", "r", stdin);
		//freopen("output.txt", "w", stdout);
		fastIO();
	}
}

void solve();
void precalc();

int TID;

signed main() {
	initIO();

	int tc = 1;
//	cin >> tc;

	precalc();
	rep(tt, tc) {
		TID = tt;
//		cout << "Case #" << tt + 1 << ": ";
		solve();
	}

	if (local)
		cout << endl << "time = " << getTime() << endl;
}

void precalc() {

}

/* ================ actual code starts here ================ */

int n;
int m;

int id[3100500];
int a[200500];
int ans[3100500];
int d;
int k;
int was[200500];

void addId(int i);

set<int> s1, s2;

void add1(int x) {
	if (ans[x] != -1)
		re;

	ans[x] = k;
	s1.erase(x);
	s2.insert(x);
	if (id[x] != -1 && !was[id[x]])
		addId(id[x]);
}

void addInterval(int l, int r) {
	while (1) {
		auto it = s1.lower_bound(l);
		if (it == s1.end() || *it > r)
			re;
		add1(*it);
	}
}

void step() {
	k++;

	auto it1 = s1.begin();
	vi v;
	while (it1 != s1.end()) {
		int l = *it1;
		v.pb(l);
		auto it2 = s2.lower_bound(l);
		if (it2 == s2.end())
			break;
		int r = *it2;
		r--;
		if (l != r)
			v.pb(r);
		it1 = s1.upper_bound(r);
	}
	vi u;
	for (int x : v) {
		if (s2.count(x - 1) || s2.count(x + 1))
			u.pb(x);
	}
	for (int x : u)
		add1(x);
}

void addId(int i) {
	was[i] = 1;
	int l = max(0, d - k);
	int r = d + k;
	addInterval(a[i] + l, a[i] + r);
	addInterval(a[i] - r, a[i] - l);
}

void solve() {
	fill(id, -1);
	fill(ans, -1);

	int s;
	int q;
	cin >> n >> q >> s >> d;
	s--;
	rep(i, n) {
		cin >> a[i];
		a[i] += d;
		id[a[i]] = i;
	}
	m = a[n - 1] + 1;

	for (int i = 0; i <= m + d; i++)
		s1.insert(i);

	addId(s);
	rep(i, max(m + 1, d + 1))
		step();

	rep(i, q) {
		int x, k;
		cin >> x >> k;
		x--;
		if (x == s || ans[a[x]] <= k)
			cout << "Yes" << endl;
		else
			cout << "No" << endl;
	}
}









