#include <bits/stdc++.h>

using namespace std;

#define sz(x) (int)(x).size()
#define pb push_back

void solve() {
    int n, k, q; cin >> n >> k >> q;
    vector<int> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];

    vector<vector<int>> g(n);
    stack<int> st;
    for (int i = n - 1; i >= 0; i--) {
        while (!st.empty() && a[st.top()] < a[i]) st.pop();
        if (!st.empty()) {
            g[i].pb(st.top());
            g[st.top()].pb(i);
        }
        st.push(i);
    }
    while (!st.empty()) st.pop();
    for (int i = 0; i < n; i++) {
        while (!st.empty() && a[st.top()] < a[i]) st.pop();
        if (!st.empty()) {
            g[i].pb(st.top());
            g[st.top()].pb(i);
        }
        st.push(i);
    }

    while (q--) {
        int l, r; cin >> l >> r;
        l--; r--;
        int pmx = l;
        for (int i = min(l, r); i <= max(l, r); i++) {
            if (a[i] > a[pmx]) pmx = i;
        }
        vector<int> dist(n, -1);
        dist[l] = 0;
        queue<int> q;
        q.push(l);
        while (!q.empty()) {
            int v = q.front();
            q.pop();
            for (auto &u : g[v]) {
                if (dist[u] == -1) {
                    dist[u] = dist[v] + 1;
                    q.push(u);
                }
            }
        }
        int S = dist[pmx];
        dist.assign(n, -1);
        dist[r] = 0;
        q.push(r);
        while (!q.empty()) {
            int v = q.front();
            q.pop();
            for (auto &u : g[v]) {
                if (dist[u] == -1) {
                    dist[u] = dist[v] + 1;
                    q.push(u);
                }
            }
        }
        S += dist[pmx];
        cout << S - 1 << '\n';
    }
}

signed main() {
    int tt = 1;
    #ifdef LOCAL 
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        cin >> tt;
    #else 
        ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    #endif

    while (tt--) {
        solve();
    }
    return 0;
}