// #include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <vector>
#include <iomanip>
#include <string>
#include <queue>
#include <set>
#include <deque>
using namespace std;
#define int long long
#define endl "\n"
#define fi first
#define se second
const int M=998244353;
const int inf = 1e14;
const int LOG=20;
const int N=3e5+5;
int n , m , c , w , k , t=1 , q=1 , x , y , z , l , r;
void solve()
{
cin >> n >> m >> q;
vector<pair<int,int>>a(m);
vector<int>d(n+1);
vector<int>u;
int mo=1;
for (int i=0;i<m;i++){
cin >> x >> y;
a[i]={x,y};
for (int j=x;j<=y;j++){
if (d[j]){
u.push_back(mo-d[j]);
}
d[j]=mo;
mo++;
}
}
u.push_back(-1);
u.push_back(inf);
sort(u.begin(),u.end());
for (int i=0;i<q;i++){
cin >> x;
int l=0;
int h=u.size();
int mi=(l+h+1)/2;
while (l<h){
if (u[mi]>x){
h=mi-1;
}
else{
l=mi;
}
mi=(l+h+1)/2;
}
cout << u.size()-mi-2 << " ";
}
cout << endl;
}
signed main()
{
ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
cin.tie(0), cout.tie(0);//DO NOT USE IN INTERACTIVE
cout << fixed << setprecision(9);
srand(time(0));
// int t=1;
// cin >> t;
for (int _=1;_<=t;_++){
solve();
q++;
}
}
