#include<iostream>

#include<cstdio>

using namespace std;

inline int rd(){

  int ret=,f=;char c;

  while(c=getchar(),!isdigit(c))f=c=='-'?-:;

  while(isdigit(c))ret=ret*+c-'',c=getchar();

  return ret*f;

}

const int MAXN=;

int n,m;

int a[MAXN],b[MAXN];

bool check(int x){

  int mn=<<;

  for(int i=;i<=n;i++)b[i]=a[i]<x?-:;

  for(int i=;i<=n;i++){

    if(i>=m) mn=min(mn,b[i-m]);

    b[i]+=b[i-];

    if(i>=m&&b[i]>mn)return ;

  }

  return ;

}

int main(){

  n=rd();m=rd();

  int l=,r=<<,mid,ans;

  for(int i=;i<=n;i++) a[i]=rd();

  while(l<=r){

    mid=l+r>>;

    if(check(mid))ans=mid,l=mid+;

    else r=mid-;

  }

  cout<<ans;

  return ;

}

#include<iostream>

#include<cstdio>

#include<map>

using namespace std;

typedef long long ll;

inline ll rd(){

  ll ret=,f=;char c;

  while(c=getchar(),!isdigit(c))f=c=='-'?-:;

  while(isdigit(c))ret=ret*+c-'',c=getchar();

  return ret*f;

}

const int MAXN=;

int a[MAXN];

ll l,r,l1,r1;

map<ll,ll> mp[MAXN];

ll dfs(int cur,ll sum,ll lim,ll xzero){

  if(!cur){

    if(xzero) sum=;

    return (l1<=sum&&sum<=r1);

  }

  if(!xzero&&!lim&&mp[cur].count(sum))return mp[cur][sum];

  ll ret=;

  int mx=;

  if(lim)mx=a[cur];

  for(int i=;i<=mx;i++){

    if(xzero)ret+=dfs(cur-,(i==)?1ll:i*1ll,lim&&(i==mx),xzero&&(i==));

    else ret+=dfs(cur-,sum*1ll*i,lim&&(i==mx),xzero&&(i==));

  }

  if(!xzero&&!lim)mp[cur][sum]=ret;

  return ret;

}

ll solve(ll x){

  int cnt=;

  while(x){

    a[++cnt]=x%;

    x/=;

  }

  return dfs(cnt,,,);

}

int main(){

  l=rd();r=rd();l1=rd();r1=rd();

  cout<<solve(r)-solve(l-);

  return ;

}

#include<iostream>

#include<cstdio>

#include<vector>

using namespace std;

inline int rd(){

  int ret=,f=;char c;

  while(c=getchar(),!isdigit(c))f=c=='-'?-:;

  while(isdigit(c))ret=ret*+c-'',c=getchar();

  return ret*f;

}

const int MAXN=;

int n,m,q;

vector<int> vec[MAXN];

int rt[MAXN];

struct Edge{

  int next,to;

}e[MAXN<<];

int ecnt,head[MAXN];

inline void add(int x,int y){

  e[++ecnt].next = head[x];

  e[ecnt].to = y;

  head[x] = ecnt;

}

int fa[MAXN],hson[MAXN],siz[MAXN],dep[MAXN];

int top[MAXN],id[MAXN],tim=;

int ll[MAXN],rr[MAXN];

void dfs1(int x,int pre){

  fa[x]=pre;siz[x]=;dep[x]=dep[pre]+;

  ll[x]=++tim;id[tim]=x;

  int mx=;

  for(int i=head[x];i;i=e[i].next){

    int v=e[i].to;

    if(v==pre) continue;

    dfs1(v,x);siz[x]+=siz[v];

    if(siz[v]>mx){mx=siz[v];hson[x]=v;}

  }

  rr[x]=tim;

}

void dfs2(int x,int tp){

  top[x]=tp;

  if(hson[x])dfs2(hson[x],tp);

  for(int i=head[x];i;i=e[i].next){

    int v=e[i].to;

    if(v==fa[x]||v==hson[x]) continue;

    dfs2(v,v);

  }

}

int lca(int x,int y){

  while(top[x]!=top[y]){

    if(dep[top[x]]<dep[top[y]])swap(x,y);

    x=fa[top[x]];

  }

  return dep[x]<=dep[y]?x:y;

}

int ch[MAXN*][],val[MAXN*],tot;

void update(int x,int &cur,int l,int r){

  int f=cur;cur=++tot;val[cur]=val[f]+;

  ch[cur][]=ch[f][];ch[cur][]=ch[f][];

  if(l==r)return;

  int mid=l+r>>;

  if(x<=mid)update(x,ch[cur][],l,mid);

  else update(x,ch[cur][],mid+,r);

}

int query(int cur,int l,int r,int f,int K){

  if(val[f]-val[cur]<K) return -;

  if(l==r)return l;

  int mid=l+r>>;

  if(K<=val[ch[f][]]-val[ch[cur][]])

    return query(ch[cur][],l,mid,ch[f][],K);

  return query(ch[cur][],mid+,r,ch[f][],K-(val[ch[f][]]-val[ch[cur][]]));

}

int main(){

  int x,y;

  n=rd();m=rd();

  for(int i=;i<n;i++){

    x=rd();y=rd();add(x,y);add(y,x);

  }

  dfs1(,);dfs2(,);

  for(int i=;i<=m;i++){

    x=rd();y=rd();

    int z=lca(x,y);

    vec[x].push_back(dep[z]);

    vec[y].push_back(dep[z]);

  }

  for(int i=;i<=n;i++){

    rt[i]=rt[i-];

    int up=vec[id[i]].size();

    for(int j=;j<=up-;j++){

      update(vec[id[i]][j],rt[i],,n);

      }

  }

  q=rd();

  int ans=;

  for(int i=;i<=q;i++){

    x=rd();y=rd();

    if(!y)ans=dep[x]-dep[];

    else{

      int tmp=query(rt[ll[x]-],,n,rt[rr[x]],y);

      if(tmp==-||tmp>=dep[x])ans=;

      else ans=dep[x]-tmp;

    }

    printf("%d\n",ans);

  }

}