#include <chrono>
#include <cassert>
#include <cstdlib>
#include <vector>
#include <algorithm>
#include <array>
#include <numeric>
#include <cstdio>
#include <iostream>
using namespace std;

int timelimit = 5 * 1000, elapsed = 0, margin = 50;

class Timer {
  chrono::system_clock::time_point start_time = chrono::system_clock::now();
public:
  Timer() {}
  long long get_elapsed_time() {
    auto diff = chrono::system_clock::now() - start_time;
    return chrono::duration_cast<chrono::milliseconds>(diff).count();
  }
} timer;


constexpr int N = 200000, Q = 200000;
int WT, ST;
int W[N], L[Q], R[Q];
long long Wsum[N];

long long initial_cost(int i) {
    return Wsum[R[i]] - (L[i] == 0 ? 0 : Wsum[L[i] - 1]);
}

long long adj_cost(int i, int j) {
    const int a = min(L[i], L[j]), b = max(L[i], L[j]),
        c = min(R[i], R[j]), d = max(R[i], R[j]);
    return (a == b ? 0 : Wsum[b - 1] - (a == 0 ? 0 : Wsum[a - 1])) +
        (c == d ? 0 : Wsum[d - 1] - (c == 0 ? 0 : Wsum[c - 1]));
}

long long calc_cost(const vector<int> &ans) {
    long long c = initial_cost(ans[0]);
    for (int i = 1; i < Q; ++i) c += adj_cost(ans[i - 1], ans[i]);
    return c;
}

long long score_of_cost(long long cost) {
    constexpr long long n = (long long)1e18;
    return n % cost * 2 >= cost ? n / cost + 1 : n / cost;
}

void read_input() {
    scanf("%*d %*d %d %d", &WT, &ST);
    for (int i = 0; i < N; i++) scanf(" %d", W + i);
    for (int i = 0; i < Q; i++) scanf(" %d %d", L + i, R + i);
    Wsum[0] = W[0];
    for (int i = 1; i < N; i++) Wsum[i] = Wsum[i - 1] + W[i];
}

vector<int> solve(int B, int S) {
    array<int, N> a;
    iota(a.begin(), a.end(), 0);
    vector<vector<int>> buckets((N + B - 1) / B + 1);
    for (int i = 0; i < Q; i++) {
        const int b = L[i] / B;
        buckets[b].push_back(i);
    }
    vector<int> ans;
    for (int b = 0; b < buckets.size(); ++b) {
        vector<int> &elems = buckets[b];
        sort(elems.begin(), elems.end(), [b](int i, int j) {
            if (b % 2 == 0) return make_pair(R[i], L[i]) < make_pair(R[j], L[j]);
            else return make_pair(R[i], L[i]) > make_pair(R[j], L[j]);
        });
        for (int i : elems) ans.push_back(i);
    }

    long long cur_cost = calc_cost(ans);
    cerr << cur_cost << ' ' << score_of_cost(cur_cost) << endl;
    for (;;) {
        for (int i = 1; i < N; ++i) {
            if (timer.get_elapsed_time() + margin > timelimit) return ans;
            const int jmax = min(N, i + S);
            for (int j = i + 1; j < jmax; ++j) {
                long long diff = 0;
                if (i > 0) {
                    diff -= adj_cost(ans[i - 1], ans[i]);
                    diff += adj_cost(ans[i - 1], ans[j]);
                }
                if (j + 1 < N) {
                    diff -= adj_cost(ans[j], ans[j + 1]);
                    diff += adj_cost(ans[i], ans[j + 1]);
                }
                if (diff <= 0) {
                    reverse(ans.begin() + i, ans.begin() + j + 1);
                    cur_cost += diff;
                }
            }
        }

        cerr << cur_cost << ' ' << score_of_cost(cur_cost) << endl;
    }

    return ans;
}

int main(int argc, char **argv) {
    read_input();

    const int B = argc <= 1 ? 1500 : atoi(argv[1]);
    const int S = argc <= 2 ? 300 : atoi(argv[2]);
    const vector<int> ans = solve(B, S);

    for (int i : ans) cout << i + 1 << ' ';
    cout << endl;
}