#include <bits/stdc++.h>
using namespace std;
#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second
const int M = 1e9+7;
const int inf = 1e18;
void io(){
#ifndef ONLINE_JUDGE
freopen("input.in","r",stdin);
// freopen("outputf.in","w",stdout*);
#endif
ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
cin.tie(0), cout.tie(0);
cout << fixed<<setprecision(9);
}
int bp(int x, int y, int p){
int res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int MI(int n, int p){
return bp(n, p - 2, p);
}
int mul(int x,int y, int p){
return x * 1ull * y % p;
}
int di(int x,int y, int p){
return mul(x, MI(y, p), p);
}
int n , m , k , q,s;
void yn(int t){
if(t){
cout<<"YES"<<endl;
}
else{
cout<<"NO"<<endl;
}
}
void solve(int testcase_number){
cin>>n>>m>>q;
vector<int>las(n+1,-1);
int day = 1;
vector<int>co;
for(int i = 0;i<m;i++){
int l,r;
cin>>l>>r;
for(int j = l;j<=r;j++){
if(las[j] == -1){
co.pb(-1);
las[j] = day;
}
else{
co.pb(abs(las[j]-day)-1);
las[j] = day;
}
day++;
}
}
sort(all(co));
// reverse(all(co));
// print(co);
while(q--){
cin>>s;
int l =0 ;
int r = co.size();
while(r-l>1){
int mid = (l+r)/2;
if(co[mid]<s){
l = mid;
}
else{
r = mid;
}
}
cout<<co.size()-l-1<<" ";
}
cout<<endl;
}
signed main(){
// io();
int t = 1;
// cin>>t;
for(int i = 1;i<=t;i++){
solve(i);
}
}
