#include <bits/stdc++.h>
#define fo(i, d, c) for (int i = d; i <= c; i++)
#define fod(i, c, d) for (int i = c; i >= d; i--)
#define maxn 1000010
#define N 5010
#define fi first
#define se second
#define pb emplace_back
#define en cout << "\n";
#define int long long
#define inf (int)1e18
#define pii pair<int, int>
#define vii vector<pii>
#define lb(x) x & -x
#define bit(i, j) ((i >> j) & 1)
#define offbit(i, j) (i ^ (1LL << j))
#define onbit(i, j) (i | (1LL << j))
#define vi vector<int>
#define all(x) x.begin(), x.end()
template <typename T1, typename T2>
bool minimize(T1 &a, T2 b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <typename T1, typename T2>
bool maximize(T1 &a, T2 b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
using namespace std;
const int nsqrt = 450;
const int mod = 1e9 + 7;
int n, m, q, l[maxn], r[maxn], s[maxn];
namespace sub2
{
struct BIT
{
int t[maxn];
void up(int x, int val)
{
for (; x ; x -= lb(x))
t[x] += val;
}
int get(int x)
{
int ans = 0;
for (; x < maxn; x += lb(x))
ans += t[x];
return ans;
}
}t;
vi adj[N];
void solve()
{
vi v;
fo(i,1,m)
{
fo(j,l[i],r[i])
{
v.pb(j);
adj[j].pb((int)v.size());
}
}
fo(i,1,q) minimize(s[i],v.size() + 5);
fo(i,1,n)
{
fo(j,1,(int)adj[i].size() - 1)
{
t.up(adj[i][j] - adj[i][j - 1],1);
}
}
fo(i,1,q) cout << t.get(s[i] + 1) << ' ';
}
}
main()
{
#define name "TASK"
if (fopen(name ".inp", "r"))
{
freopen(name ".inp", "r", stdin);
freopen(name ".out", "w", stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m >> q;
fo(i, 1, m) cin >> l[i] >> r[i];
fo(i, 1, q) cin >> s[i];
sub2::solve();
}
