#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

#define maxn 200500

using namespace std;

int n,m,a[maxn],x,y,now,root,d[maxn],ans=,q,r;

int ls[maxn<<],rs[maxn<<],g[maxn*],nxt[maxn*],go[maxn*],sum[maxn<<],cnt=,tot=;

void build(int &now,int left,int right)

{

    now=++tot;

    if (left==right)

    {

        sum[now]=;

        return;

    }

    int mid=(left+right)>>;

    build(ls[now],left,mid);

    build(rs[now],mid+,right);

    sum[now]=sum[ls[now]]+sum[rs[now]];

}

void modify(int now,int left,int right,int l,int r,int num)

{

    if ((left==l) && (right==r))

    {

        d[num]++;

        go[++cnt]=num;

        nxt[cnt]=g[now];

        g[now]=cnt;

        return;

    }

    int mid=(left+right)>>;

    if (r<=mid) modify(ls[now],left,mid,l,r,num);

    else if (l>=mid+) modify(rs[now],mid+,right,l,r,num);

    else

    {

        modify(ls[now],left,mid,l,mid,num);

        modify(rs[now],mid+,right,mid+,r,num);

    }

}

void change(int now,int left,int right,int pos)

{

    sum[now]--;

    if (!sum[now])

    {

        int t=g[now];

        while (t)

        {

            d[go[t]]--;

            if (!d[go[t]]) ans++;

            t=nxt[t];

        }

    }

    if (left==right) return;

    int mid=(left+right)>>;

    if (pos<=mid) change(ls[now],left,mid,pos);

    else change(rs[now],mid+,right,pos);

}

int main()

{

    memset(d,,sizeof(d));

    memset(g,,sizeof(g));

    scanf("%d%d",&n,&m);

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

        scanf("%d",&a[i]);

    build(root,,n);

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

    {

        scanf("%d%d",&x,&y);

        modify(root,,n,x,y,i);

    }

    scanf("%d",&q);

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

    {

        scanf("%d",&r);

        r=(r+ans-)%n+;

        a[r]--;

        if (!a[r]) change(root,,n,r);

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

    }

    return ;

}