#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define int long long
typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
typedef vector<bool> vb;
#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)
#define all(x) x.begin(),x.end()
#define fi first
#define se second
#define pb push_back
#define sp <<" "<<
#define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl;
#define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;
#define DEBUG(x) cout<<#x sp x<<endl;
#define carp(x,y) ((x%MOD)*(y%MOD))%MOD
#define topla(x,y) ((x%MOD)+(y%MOD))%MOD
#define mid (l+r)/2
const int MAXN=1e6+5;
const int MOD=1e9+7;
const int INF=1e18;
int l[MAXN], r[MAXN];
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n,m,q;
cin>>n>>m>>q;
bool f=true;
FORE(i,1,m+1){
cin>>l[i]>>r[i];
if(l[i]!=1) f=false;
}
vii qq(q+1);
FORE(i,1,q+1) {cin>>qq[i].fi;qq[i].se=i;}
sort(all(qq));
vi yer(n+1,0);
vi ans(q+1,0);
FORE(i,1,n+1){ //tüm sayılar için her m'e bak
int len=0;
FORE(j,1,m+1){
if(l[j]<=i and i<=r[j]){
int yeni=len+i-l[j]+1;
if(yer[i]!=0){
pii temp={yeni-yer[i]-1,INF};
auto it=upper_bound(all(qq),temp);
if(it!=qq.begin()){
it--;
//cout<<"here" sp it->fi sp it->se<<endl;
ans[it->se]++;
}
}
yer[i]=yeni;
}
len+=r[j]-l[j]+1;
}
}
int tut=0;
for(int i=q;i>0;i--){
ans[qq[i].se]+=tut;
tut+=ans[qq[i].se]-tut;
}
FORE(i,1,q+1) cout<<ans[i]<<' ';
cout<<endl;
}
