#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define fi first
#define se second
#define eb emplace_back
#define popc __builtin_popcount
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vp;
typedef unsigned long long ull;
typedef long double ld;

int read() {
  int x=0,w=1; char c=getchar(); 
  while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
  while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();}
  return x*w;
}

const int N=1e5+9;
int l[N][25],r[N][25],st[N],a[N],n,k,q;

signed main() {
  n=read(), k=read(), q=read();
  rep(i,1,n) a[i]=read(), l[i][0]=r[i][0]=i;
  for(int i=1,top=0;i<=n;i++) {
    while(top&&a[st[top]]<a[i]) --top;
    if(top) l[i][0]=st[top]; st[++top]=i;
  }
  for(int i=n,top=0;i>=1;i--) {
    while(top&&a[st[top]]<a[i]) --top;
    if(top) r[i][0]=st[top]; st[++top]=i;
  }
  rep(h,1,20) rep(i,1,n) {
    l[i][h]=min(l[l[i][h-1]][h-1],l[r[i][h-1]][h-1]);
    r[i][h]=max(r[r[i][h-1]][h-1],r[l[i][h-1]][h-1]);
  }
  rep(i,1,q) {
    int x=read(), y=read(), ans=0; if(x>y) swap(x,y);
    for(int u=x,v=x,h=20;h>=0;h--) {
      int nu=min(l[u][h],l[v][h]), nv=max(r[u][h],r[v][h]);
      if(nv<y) u=nu, v=nv, ans+=1<<h, x=v;
    }
    for(int u=y,v=y,h=20;h>=0;h--) {
      int nu=min(l[u][h],l[v][h]), nv=max(r[u][h],r[v][h]);
      if(nu>x) u=nu, v=nv, ans+=1<<h, y=u;
    }
    printf("%d\n",ans);
  }
  return 0;
}