#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, k, q;
    cin >> n >> k >> q;

    vector<int> a(n), stk, L(n, -1), R(n, n);

    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }

    for (int i = 0; i < n; ++i) {
        while (!stk.empty() && a[stk.back()] < a[i]) {
            R[stk.back()] = i;
            stk.pop_back();
        }
        if (!stk.empty()) {
            L[i] = stk.back();
            if (a[stk.back()] == a[i]) {
                R[stk.back()] = i;
                stk.pop_back();
            }
        }
        stk.push_back(i);
    }

    vector<vector<int>> adj(n);

    for (int i = 0; i < n; ++i) {
        for (int x : {L[i], R[i]}) {
            if (x >= 0 && x < n) {
                adj[x].push_back(i);
                adj[i].push_back(x);
            }
        }
    }

    for (int i = 0; i < q; ++i) {
        int x, y;
        cin >> x >> y;
        x -= 1, y -= 1;

        vector<int> dist(n, -1);
        queue<int> qwq;
        dist[x] = 0;
        qwq.push(x);

        while (!qwq.empty()) {
            int v = qwq.front();
            qwq.pop();

            for (int to : adj[v]) {
                if (dist[to] == -1) {
                    dist[to] = dist[v] + 1;
                    qwq.push(to);
                }
            }
        }

        cout << dist[y] - 1 << '\n';
    }

    return 0;
}