#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define int long long
#define all(x) (x).begin(), (x).end()
typedef long double ld;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
typedef vector<vector<ll>> vvll;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef map<int, int> mii;
typedef unordered_map<int, int> umii;
const int mod = 1e9 + 7;
const int inf = INTMAX_MAX;
const bool tc = false;
struct SparseSegtree {
struct Node {
int sum = 0;
int lazy = 0;
Node* l = nullptr;
Node* r = nullptr;
};
const int LO = 0;
const int HI = (int)1e12 + 10;
Node* root;
SparseSegtree() { root = new Node(); }
inline void apply(Node* n, int s, int e, int add) {
n->sum += add * (e - s + 1);
n->lazy += add;
}
inline void push(Node* n, int s, int e) {
if (!n || n->lazy == 0 || s == e) return;
int m = (s + e) >> 1;
if (!n->l) n->l = new Node();
if (!n->r) n->r = new Node();
apply(n->l, s, m, n->lazy);
apply(n->r, m + 1, e, n->lazy);
n->lazy = 0;
}
void range_add(Node* n, int s, int e, int l, int r, int val) {
if (!n || r < s || e < l) return;
if (l <= s && e <= r) {
apply(n, s, e, val);
return;
}
push(n, s, e);
int m = (s + e) >> 1;
if (!n->l) n->l = new Node();
if (!n->r) n->r = new Node();
range_add(n->l, s, m, l, r, val);
range_add(n->r, m + 1, e, l, r, val);
n->sum = (n->l ? n->l->sum : 0) + (n->r ? n->r->sum : 0);
}
int range_sum(Node* n, int s, int e, int l, int r) {
if (!n || r < s || e < l) return 0;
if (l <= s && e <= r) return n->sum;
push(n, s, e);
int m = (s + e) >> 1;
return range_sum(n->l, s, m, l, r)
+ range_sum(n->r, m + 1, e, l, r);
}
inline void add(int l, int r, int val) {
if (l > r) return;
l = max(l, LO);
r = min(r, HI);
if (l > r) return;
range_add(root, LO, HI, l, r, val);
}
inline int sum(int l, int r) {
if (l > r) return 0;
l = max(l, LO);
r = min(r, HI);
if (l > r) return 0;
return range_sum(root, LO, HI, l, r);
}
};
struct Segtree {
int n, h;
vector<int> t, d, len;
Segtree(int _n) : n(_n) {
h = 32 - __builtin_clz(n);
t.assign(2*n, 0);
d.assign(n, -1); // -1 = no lazy (assignment tree)
len.assign(2*n, 1); // segment length per node
for (int i = n - 1; i > 0; i--)
len[i] = len[i<<1] + len[i<<1|1];
for (int i = n; i < 2*n; i++)
t[i] = 1; // default value = 1
for (int i = n - 1; i > 0; i--)
t[i] = t[i<<1] + t[i<<1|1];
}
inline void apply(int p, int v) {
t[p] = v * len[p];
if (p < n) d[p] = v;
}
inline void push(int p) {
for (int s = h; s > 0; s--) {
int i = p >> s;
if (d[i] != -1) {
apply(i<<1, d[i]);
apply(i<<1|1, d[i]);
d[i] = -1;
}
}
}
inline void build(int p) {
while (p > 1) {
p >>= 1;
if (d[p] == -1)
t[p] = t[p<<1] + t[p<<1|1];
else
t[p] = d[p] * len[p];
}
}
void range_set(int l, int r, int v) {
if (l > r) return;
int l0 = l += n, r0 = r += n + 1;
push(l0);
push(r0 - 1);
for (; l < r; l >>= 1, r >>= 1) {
if (l & 1) apply(l++, v);
if (r & 1) apply(--r, v);
}
build(l0);
build(r0 - 1);
}
int range_sum(int l, int r) {
if (l > r) return 0;
l += n;
r += n + 1;
push(l);
push(r - 1);
int res = 0;
for (; l < r; l >>= 1, r >>= 1) {
if (l & 1) res += t[l++];
if (r & 1) res += t[--r];
}
return res;
}
int range_sum(pii q) {
return range_sum(q.fi, q.se);
}
};
inline void solve() {
int n, m, q; cin >> n >> m >> q;
vector<pii> pairs(m); for (int i = 0; i < m; i++) {
cin >> pairs[i].fi >> pairs[i].se;
pairs[i].fi--; pairs[i].se--;
}
// SparseSegtree sparse;
Segtree uni(n);
vector<pii> vals;
for (int r = m - 1; r >= 0; r--) {
uni.range_set(0, n - 1, 0);
uni.range_set(pairs[r].fi, pairs[r].se, 1);
int gapsum = 0;
for (int l = r - 1; l >= 0; l--) {
int intersection = uni.range_sum(pairs[l]);
int bonus = pairs[l].se - pairs[r].fi;
// cout << l + 1 << '\n';
// cout << pairs[l].fi + 1 << " " << pairs[l].se + 1 << '\n';
// cout << r + 1 << '\n';
// cout << pairs[r].fi + 1 << " " << pairs[r].se + 1 << '\n';
// add intersection at (gapsum + bonus)
vals.pb({gapsum + bonus, intersection});
//sparse.add(gapsum + bonus, gapsum + bonus, intersection);
gapsum += pairs[l].se - pairs[l].fi + 1;
uni.range_set(pairs[l].fi, pairs[l].se, 0);
// cout << '\n';
}
}
sort(all(vals));
int ans = 0; for (auto &x : vals) ans += x.se;
int ptr = 0;
while (q--) {
int x; cin >> x;
while (ptr < vals.size()) {
if (vals[ptr].fi >= x) break;
ans -= vals[ptr].se;
ptr++;
}
cout << ans << ' ';
}
cout << '\n';
}
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
signed main() {
ios::sync_with_stdio(false);
cout.tie(0);
cin.tie(0);
//setIO();
int t = 1;
if (tc) {
cin >> t;
}
while (t--) {
solve();
}
}
