#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<utility>
#include<vector>
#define N 500005
#define int long long
#define mem(x) memset(x,0,sizeof(x))
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int n,m,k,a[N],b[N],p[N],s[N],tt,op,ans[N],x,y,z;
int t[N];
struct node{int i,l;};
vector<node>v[N];
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
void ckmax(int &x,int y){if(y>x)x=y;}
void ckmin(int &x,int y){if(y<x)x=y;}
int read(){
    int sum=0;bool f=0;char c=getchar();
    for(;c<48||c>57;c=getchar())if(c==45)f=1;
    for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
    return f?-sum:sum;
}
void ud(int x,int k){while(x<=n)t[x]+=k,x+=x&-x;}
int gs(int x){int sum=0;while(x)sum+=t[x],x&=x-1;return sum;}
signed main(){
    freopen("stack.in","r",stdin);freopen("stack.out","w",stdout);
    n=read();m=read();
    fo(i,1,n)a[i]=read();
    fo(i,1,n)b[i]=read();
    fo(i,1,n){
        while(tt&&!(a[i]!=a[s[tt]]&&b[i]<b[s[tt]]))tt--;
        p[i]=s[tt]+1;
        s[++tt]=i;
    }
    fo(i,1,m){
        x=read();y=read();
        v[y].push_back({i,x});
    }
    fo(i,1,n){
        ud(p[i],1);
        if(i<n)ud(i+1,-1);
        for(auto j:v[i])
            ans[j.i]=gs(j.l);
    }
    fo(i,1,m)printf("%lld\n",ans[i]);
    return 0;
}