#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define per(i,a,b) for (int i = a; i >= b; i--)
#define fi first
#define se second
#define pii pair<int,int>
#define pb push_back
const int MAXN = 4e6+10;
const int INF = 1e18 + 5;
const int MOD = 1e9+7;
int a[MAXN], cnt[MAXN],sfx[MAXN];
void solve() {
int n,m,q;cin >> n >> m >> q;
rep(i,1,n) a[i] = -1;
int t = 0, mx = 0;
rep(i,1,m) {
int l,r;cin >> l >> r;
rep(j,l,r) {
if(a[j]!=-1)cnt[t-a[j]]++;
mx = max(t-a[j], mx);
a[j] = ++t;
}
}
per(i,mx,0) sfx[i] = sfx[i+1] + cnt[i];
rep(i,1,q) {
int x;cin >> x;
cout << sfx[min(x,mx+1)] << " \n"[i==q];
}
}
int32_t main() {
ios_base::sync_with_stdio(0); cin.tie(nullptr);
int tt = 1;
//cin >> tt;
while (tt--) solve();
return 0;
}
