#include <bits/stdc++.h>
#define ll long long
const int N = 1e6+5;
const ll mod = 998244353;
using namespace std;
int n,m,q;
vector<ll> op(2005,0),look;
void solve()
{
cin >> n >> m >> q;
vector<pair<ll,ll>> a(m+1);
vector<ll> arr;
for (int i=1;i<=m;i++)
{
cin >> a[i].first >> a[i].second;
for (int j=a[i].first;j<=a[i].second;j++)
{
arr.push_back(j);
}
}
vector<ll> s(q+1);
for (int i=1;i<=q;i++)
{
cin >> s[i];
}
ll cnt = 0;
for (ll i: arr)
{
++cnt;
if (op[i] == 0)
{
op[i] = cnt;
}else
{
look.push_back(cnt-op[i]);
op[i] = cnt;
}
}
sort(look.begin(),look.end());
// for (ll i: look)
// {
// cout << i << ' ';
// }
// cout << '\n';
for (int i=1;i<=q;i++)
{
auto it = upper_bound(look.begin(),look.end(),s[i])-look.begin();
cout << (int)look.size()-it << ' ';
}
cout << '\n';
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
solve();
}
