#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 Segtree {
int n;
vector<int> sum;
vector<int> lazy;
vector<char> has;
Segtree(int _n) : n(_n) {
sum.assign(4 * n, 0);
lazy.assign(4 * n, 0);
has.assign(4 * n, 0);
build(1, 0, n - 1);
}
void build(int i, int l, int r) {
if (l == r) { sum[i] = 1; return; }
int m = (l + r) >> 1;
build(i << 1, l, m);
build(i << 1 | 1, m + 1, r);
sum[i] = sum[i << 1] + sum[i << 1 | 1];
}
inline void apply(int i, int l, int r, int v) {
sum[i] = v * (r - l + 1);
lazy[i] = v;
has[i] = 1;
}
inline void push(int i, int l, int r) {
if (!has[i] || l == r) return;
int m = (l + r) >> 1;
apply(i << 1, l, m, lazy[i]);
apply(i << 1 | 1, m + 1, r, lazy[i]);
has[i] = 0;
}
void range_set(int ql, int qr, int v) { range_set(1, 0, n - 1, ql, qr, v); }
void range_set(int i, int l, int r, int ql, int qr, int v) {
if (qr < l || r < ql) return;
if (ql <= l && r <= qr) { apply(i, l, r, v); return; }
push(i, l, r);
int m = (l + r) >> 1;
range_set(i << 1, l, m, ql, qr, v);
range_set(i << 1 | 1, m + 1, r, ql, qr, v);
sum[i] = sum[i << 1] + sum[i << 1 | 1];
}
int range_sum(int ql, int qr) { return range_sum(1, 0, n - 1, ql, qr); }
int range_sum(int i, int l, int r, int ql, int qr) {
if (qr < l || r < ql) return 0;
if (ql <= l && r <= qr) return sum[i];
push(i, l, r);
int m = (l + r) >> 1;
return range_sum(i << 1, l, m, ql, qr) + range_sum(i << 1 | 1, m + 1, r, ql, qr);
}
};
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].fi, pairs[l].se);
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();
}
}
