1 #include <cstdio>
 2 #include <cstring>
 3 #include <algorithm>
 4 #define inc(i,j,k) for(int i=j;i<=k;i++)
 5 #define maxn 100100
 6 using namespace std;
 7
 8 struct nd{int v,n;}; nd nds[maxn*50]; int v[maxn*4],tot[maxn],g[maxn*4],n,m,a[maxn],q,ans,ndss;
 9 inline int read(){
10     char ch=getchar(); int f=1,x=0;
11     while(ch<'0'||ch>'9'){if(ch=='-')f=-1; ch=getchar();}
12     while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
13     return f*x;
14 }
15 void ins(int num,int node){
16     nds[++ndss]=(nd){num,g[node]}; g[node]=ndss;
17 }
18 void update(int x){
19     for(int i=g[x];i;i=nds[i].n){tot[nds[i].v]--; if(!tot[nds[i].v])ans++;}
20 }
21 void build(int x,int l,int r){
22     if(l==r){v[x]=a[l]; return;}; int mid=l+r>>1;
23     build(x<<1,l,mid); build(x<<1|1,mid+1,r); v[x]=v[x<<1]+v[x<<1|1];
24 }
25 void insert(int x,int l,int r,int ql,int qr,int num){
26     if(ql<=l&&r<=qr){ins(num,x); tot[num]++; return;} int mid=l+r>>1;
27     if(ql<=mid)insert(x<<1,l,mid,ql,qr,num); if(mid<qr)insert(x<<1|1,mid+1,r,ql,qr,num);
28 }
29 void change(int x,int l,int r,int q){
30     v[x]--; if(!v[x])update(x); if(l==r)return; int mid=l+r>>1;
31     if(q<=mid)change(x<<1,l,mid,q);else change(x<<1|1,mid+1,r,q);
32 }
33 int main(){
34     //freopen("in.txt","r",stdin);
35     n=read(); m=read(); inc(i,1,n)a[i]=read(); build(1,1,n);
36     inc(i,1,m){int l=read(),r=read(); insert(1,1,n,l,r,i);} q=read();
37     inc(i,1,q){int x=(read()+ans-1)%n+1; change(1,1,n,x); printf("%d\n",ans);}
38     return 0;
39 }