#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rof(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const int Maxn=1e5;

int n,m,q,s,L[Maxn+5],R[Maxn+5],a[Maxn+5];
int p[Maxn+5],id[Maxn+5],pos[Maxn+5],len[Maxn+5];
int ans[Maxn+5],K[Maxn+5],f[705][Maxn+5];
int to[Maxn+5],dx[Maxn+5],cur;
vector<int> qr[Maxn+5];

inline void Clear()
{
    For(i,0,m-1) vector<int>().swap(qr[i]);
    For(i,0,n) id[i]=pos[i]=len[i]=to[i]=dx[i]=0;
    For(i,0,q) ans[i]=0; s=cur=0;
}
inline void Work(int x)
{
    For(i,1,n)
    {
        int k=a[i],p=id[i]; if(id[i]!=id[k]) continue;
        int w=(pos[k]-pos[i]+len[p])%len[p]; f[to[len[p]]][w]++;
    }
    for(auto id:qr[x]) {int k=K[id]/m; For(i,1,cur) ans[id]+=f[i][k%dx[i]];}
    For(i,1,n)
    {
        int k=a[i],p=id[i]; if(id[i]!=id[k]) continue;
        int w=(pos[k]-pos[i]+len[p])%len[p]; f[to[len[p]]][w]=0;
    }
}
inline void Solve()
{
    cin>>m>>q,s=0,iota(a+1,a+n+1,1);
    For(i,1,m) {cin>>L[i]>>R[i]; reverse(a+L[i],a+R[i]+1);}
    For(i,1,n) p[a[i]]=i,id[i]=0;
    For(i,1,n) if(!id[i])
    {
        ++s; for(int j=p[i];;j=p[j])
            {id[j]=s,pos[j]=len[s]++; if(j==i) break;}
        if(!to[len[s]]) to[len[s]]=++cur,dx[cur]=len[s];
    }
    For(i,1,q) cin>>K[i],qr[K[i]%m].push_back(i);
    iota(a+1,a+n+1,1);
    For(i,0,m-1) Work(i),reverse(a+L[i+1],a+R[i+1]+1);
    For(i,1,q) cout<<ans[i]<<endl; Clear();
}

int main()
{
    // freopen("1.in","r",stdin);

    ios::sync_with_stdio(false);
    while(cin>>n) Solve();
    return 0;
}