#include <bits/stdc++.h>
using namespace std;
using ll = long long;

struct Mo_Algorithm{
    ll N, D, Q;//配列の要素数,幅,クエリ数
    std::vector<std::pair<ll, ll> > query;
    Mo_Algorithm(ll n) : N(n){}
    void add_query(ll l, ll r){
        query.emplace_back(l, r);
    }
    vector<ll> build(){
        Q = query.size() , D = std::max(1ll, (ll)(3 * N / (2 * sqrt(Q))));
        std::vector<ll> order(Q), Div(Q);
        for(int i = 0; i < Q; i++)Div[i] = query[i].second / D;
        std::iota(order.begin(), order.end(), 0);
        std::sort(order.begin(), order.end(), [&](ll i, ll j){
            if(Div[i] != Div[j])return Div[i] < Div[j];
            return (Div[i] & 1 ? query[i] > query[j] : query[i] < query[j]);
        });
        return order;
    }
};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int N, Q, WT, ST, L, R;
    cin >> N >> Q >> WT >> ST;
    vector<ll> W(N), sw(N + 1);
    for(int i = 0; i < N; i++){
        cin >> W[i];
        sw[i + 1] = sw[i] + W[i];
    }
    Mo_Algorithm MA(sw.back());
    for(int i = 0; i < Q; i++){
        cin >> L >> R;
        MA.add_query(sw[--L], sw[R]);
    }
    auto ans = MA.build();
    for(int i = 0; i < ans.size(); i++){
        cout << ++ans[i] << (i + 1 == ans.size() ? '\n' : ' ');
    }
}