Problem: There is an infinite pond that can be represented with a number line. There are n rocks in the pond, numbered from 1 to n. The i-th rock is located at an integer coordinate a_i. The coordinates of the rocks are pairwise distinct. The rocks are numbered in the increasing order of the coordinate, so a_1 < a_2 < ... < a_n.

A robot frog sits on the rock number s. The frog is programmable. It has a base jumping distance parameter d. There also is a setting for the jumping distance range. If the jumping distance range is set to some integer k, then the frog can jump from some rock to any rock at a distance from d - k to d + k inclusive in any direction. The distance between two rocks is an absolute difference between their coordinates.

You are assigned a task to implement a feature for the frog. Given two integers i and k determine if the frog can reach a rock number i from a rock number s performing a sequence of jumps with the jumping distance range set to k. The sequence can be arbitrarily long or empty.

You will be given q testcases for that feature, the j-th testcase consists of two integers i and k. Print "Yes" if the i-th rock is reachable and "No" otherwise.

You can output "YES" and "NO" in any case (for example, strings "yEs", "yes", "Yes" and 'YES"' will be recognized as a positive answer).

Input

The first line contains four integers n, q, s and d (1 ≤ n, q ≤ 2 ⋅ 10^5; 1 ≤ s ≤ n; 1 ≤ d ≤ 10^6) — the number of rocks, the number of testcases, the starting rock and the base jumping distance parameter.

The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^6) — the coordinates of the rocks. The coordinates of the rocks are pairwise distinct. The rocks are numbered in the increasing order of distance from the land, so a_1 < a_2 < ... < a_n.

Each of the next q lines contains two integers i and k (1 ≤ i ≤ n; 1 ≤ k ≤ 10^6) — the parameters to the testcase.

Output

For each of the testcases print an answer. If there is a sequence of jumps from a rock number s to a rock number i with the jumping distance range set to k, then print "Yes". Otherwise, print "No".

Examples

Input


7 4 4 5
1 5 10 13 20 22 28
4 1
7 2
7 3
3 2


Output


Yes
No
Yes
Yes


Input


10 8 6 11
1 2 4 7 8 9 11 13 19 20
2 13
5 8
8 1
6 15
1 15
2 7
7 6
8 9


Output


Yes
Yes
No
Yes
Yes
Yes
Yes
Yes


Input


6 9 6 6
1 2 4 9 18 19
2 17
1 18
5 4
2 11
5 17
6 8
4 3
3 3
6 6


Output


Yes
Yes
Yes
Yes
Yes
Yes
No
No
Yes


Input


4 1 1 10
1 8 10 19
2 1


Output


Yes

Note

Explanation of the first example:

In the first testcase the destination rock is the same as the starting rock, thus no jumps are required to reach it.

In the second testcase the frog can jump any distance in the range [5 - 2; 5 + 2]. Thus, it can reach rock number 5 (by jumping 7 to the right) and rock number 3 (by jumping 3 to the left). From rock number 3 it can reach rock number 2 (by jumping 5 to the left). From rock number 2 it can reach rock number 1 (by jumping 4 to the left). However, there is no way to reach rock number 7.

In the third testcase the frog can jump any distance in the range [5 - 3; 5 + 3]. Thus, it can reach rock number 7 by jumping to rock 5 first and to 7 afterwards.

The fourth testcase is shown in the explanation for the second testcase.

Solution (in CPP):

Solution:
#pragma GCC optimize(3)
#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair<ll , ll> pll;
typedef pair<int , int> pii;
typedef long double ld;
const int maxx = 1e6 + 10;
const int maxn = 2e5 + 10;
const int inf32 = 1e9;
const ll inf64 = 1e18;
int N , Q , start , D;
int a[maxn] , fa[maxn] , ncomponent , minK[maxn];
map<int , int> id;
vector<int> component[maxn];
set<int> all_vertices;
vector<pii> MST[maxn];
int find(int x){
    return x == fa[x] ? x : fa[x] = find(fa[x]);
}
void merge(int x , int y){
    // merge component x and component y
    x = find(x);
    y = find(y);
    if(component[x].size() < component[y].size()){
        swap(x , y);
    }
    for(int v : component[y]){
        fa[v] = x;
        component[x].push_back(v);
    }
    component[y].clear();
}
void DFS(int v , int p , int w){
    minK[v] = w;
    for(auto& e : MST[v]){  
        int nv = e.x , nw = e.y;
        if(nv != p){
            DFS(nv , v , max(w , nw));
        }
    }
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> N >> Q >> start >> D;
    for(int i = 1; i <= N; ++i){
        cin >> a[i];
        id[a[i]] = i;
        fa[i] = i;
        component[i].push_back(i);
        all_vertices.insert(a[i]);
        minK[i] = inf32;
    }
    ncomponent = N;
    int round = 0;
    while(ncomponent > 1){
        ++round;
        vector<array<int , 3>> edges_this_round;
        for(int i = 1; i <= N; ++i){
            if(component[i].empty())continue;
            for(int j : component[i]){
                all_vertices.erase(a[j]);
            }
            array<int , 3> min_edge = {-1 , -1 , inf32};
            for(int j : component[i]){
                for(int k : {-1 , 1}){
                    for(int t : {-1 , 1}){
                        // find the closest vertex to t * a[j] + k * D
                        auto it = all_vertices.lower_bound(t * a[j] + k * D);
                        if(it != all_vertices.end()){
                            int w = abs(D - abs(a[j] - *it));
                            if(w < min_edge[2]){
                                min_edge = {j , id[*it] , w};
                            }
                            auto it2 = it;
                            ++it2;
                            if(it2 != all_vertices.end()){
                                int w = abs(D - abs(a[j] - *it2));
                                if(w < min_edge[2]){
                                    min_edge = {j , id[*it2] , w};
                                }
                            }
                        }
                        if(it != all_vertices.begin()){
                            --it;        
                            int w = abs(D - abs(a[j] - *it));
                            if(w < min_edge[2]){
                                min_edge = {j , id[*it] , w};
                            }
                        }
                    }
                }
            }
            for(int j : component[i]){
                all_vertices.insert(a[j]);
            }
            if(min_edge[0] != -1){
                edges_this_round.push_back(min_edge);
            }
        }
        for(auto& e : edges_this_round){
            int u = e[0] , v = e[1] , w = e[2];
            if(find(u) != find(v)){
                --ncomponent;
                merge(u , v);
                MST[u].emplace_back(v , w);
                MST[v].emplace_back(u , w);
            }
        }
    }
    DFS(start , -1 , 0);
    while(Q--){
        int i , k;
        cin >> i >> k;
        if(minK[i] <= k){
            cout << "YES" << endl;
        }
        else{
            cout << "NO" << endl;
        }
    }
}   
// frog can jump from a[i] to a[j] if k >= |d - |a[i] - a[j]||
// key : Borůvka's algorithm https://en.wikipedia.org/wiki/Bor%C5%AFvka's_algorithm (runs in E * logV normally)
// Kruskal (runs in E * logE , which is V^2 * logV^2 , too slow)
// given a component, how do we find the edge with smallest weight linked to a different component efficiently?
// answer: for each vertex i in this component we find some vertex j (in other components), such that |D - |a[i] - a[j]|| is smallest
// , by querying the cloest a[j] to a[i] - D and a[i] + D, note that a[j] can be greater tha a[i] or else.