#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
using namespace std;
const int nmax = 500001;
pii intersect(pii a, pii b) {
return {max(a.f, b.f), min(a.s, b.s)};
}
void process(vector<pll>&v, vector<ll>&l, vector <ll>&r, vector<ll>&sum, pii x, pii y, int i, int j) {
if(j == 0) return;
pii u = intersect(x, y);
if(u.f > u.s) return;
ll tot = sum[i - 1] - sum[j];
tot += r[j] - l[i];
v.pb({tot, u.s - u.f + 1});
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
int n, m, q; cin >> n >> m >> q;
vector <ll> l(m + 1), r(m + 1);
set <pair<pii, int>> st;
st.insert({{1, n}, 0});
vector <pll> v;
vector <ll> sum(m + 1);
for(int i = 1; i <= m; i++) {
cin >> l[i] >> r[i];
auto it = st.upper_bound({{l[i], r[i]}, -1});
vector <pair<pii, int>> er;
vector <pair<pii, int>> in;
if(it != st.begin()) {
it--;
pair<pii, int> x = *it;
process(v, l, r, sum, x.f, {l[i], r[i]},i, x.s);
if(x.f.s >= l[i]) {
er.pb(x);
if(x.f.s > r[i]) {
if(x.f.f <= l[i] - 1)
in.pb({{x.f.f, l[i] - 1}, x.s});
in.pb({{r[i] + 1, x.f.s}, x.s});
}
else {
if(x.f.f <= l[i] - 1)
in.pb({{x.f.f, l[i] - 1}, x.s});
}
}
}
it = st.upper_bound({{l[i], r[i]}, -1});
while(it != st.end()) {
if(it->f.f > r[i]) break;
pair<pii, int>x = *it;
process(v, l, r, sum, x.f, {l[i], r[i]}, i, x.s);
if(x.f.f <= r[i]) {
er.pb(x);
}
if(x.f.s > r[i]) {
in.pb({{r[i] + 1, x.f.s}, x.s});
}
it++;
}
for(auto to : er) st.erase(to);
for(auto to : in) st.insert(to);
st.insert({{l[i], r[i]}, i});
sum[i] = sum[i - 1] + r[i] - l[i] + 1;
}
sort(v.begin(), v.end(), greater<pll>());
int id = -1;
vector <pll> qv;
vector <ll> ans(q + 1);
for(int i = 1; i <= q;i++) {
ll x; cin >> x;
qv.pb({x, i});
}
ll cur = 0;
sort(qv.begin(), qv.end(), greater<pll>());
for(int i = 0; i < qv.size(); i++) {
while(id + 1 < v.size() && v[id + 1].f >= qv[i].f) {
cur += v[id + 1].s;
id++;
}
ans[qv[i].s] = cur;
}
for(int i = 1; i <= q; i++) cout << ans[i] << ' ';
return 0;
}
