#include <cassert>
#include <cstdint>
#include <iostream>
#include <numeric>
#include <vector>

int main() {
    int n,k,L;
    std::cin >> n >> k >> L;
    std::vector<int> a(n);
    for(auto &val: a) {
        std::cin >> val;
    }
    auto solve = [&](int l, int r) -> int {
        int ok = n, ng = 0;
        while(std::abs(ok - ng) > 1) {
            int mid = (ok + ng)/2;
            int cnt = 0;
            int nl = l;
            int ret = 0;
            for(int i = l; i < r; i++) {
                if(a[i] <= mid) {
                    cnt++;
                }
                if(cnt < k) continue;
                if(cnt > k) {
                    while(a[nl] > mid) nl++;
                    if(a[nl] <= mid) {
                        cnt--;
                    }
                    nl++;
                }
                assert(cnt == k);
                while(a[nl] > mid) nl++;
                ret += nl-l+1;
            }
            if(ret >= L) ok = mid;
            else ng = mid;
        }
        return ok;
    };
    int q;
    std::cin >> q;
    while(q--) {
        int l,r;
        std::cin >> l >> r;
        l--;
        std::cout << solve(l, r) << '\n';
    }
}