// pz3
// O(m^2 + )

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define st first
#define nd second

const int mn = 2e5+7;
const int oo = 1e18+7;
const int mxm = 4e6+7;
int n,m,q;
int l[mn], r[mn], s[mn], poms[mn];
set<int> wazne_ind;
vector<pair<pair<int,int>, int>> niezal;
map<int,int> odp;

int32_t main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>n>>m>>q;
    wazne_ind.insert(1);
    for (int i = 0; i < m; i++){
        cin>>l[i]>>r[i];
        wazne_ind.insert(l[i]);
        if (r[i] != n) wazne_ind.insert(r[i]+1);
    }
    wazne_ind.insert(n+1);
    for (auto i : wazne_ind){
        if (i == n+1) break;
        niezal.push_back({{i, (*next(wazne_ind.find(i)))-1}, oo});
    }
    int czas = 0;
    vector<pair<int,int>> wyn;
    for (int i = 0; i < m; i++){
        for (int j = 0; j < (int)niezal.size(); j++){
            int p = niezal[j].st.st;
            int k = niezal[j].st.nd;
            int t = niezal[j].nd;
            if (p >= l[i] && k <= r[i]){
                wyn.push_back({czas-t, k-p+1});
                czas += k-p+1;
                niezal[j].nd = czas;
            }
        }
    }
    for (int i = 0; i < q; i++){
        cin>>s[i];
        poms[i] = s[i];
    }
    sort(wyn.begin(), wyn.end(), greater<pair<int,int>>());
    sort(poms, poms+q, greater<int>());
    int wsk = 0;
    int ter = 0;
    for (int i = 0; i < q; i++){
        while (wsk < (int)wyn.size() && wyn[wsk].st >= poms[i]){
            ter += wyn[wsk++].nd;
        }
        odp[poms[i]] = ter;
    }
    for (int i = 0; i < q; i++){
        cout<<odp[s[i]]<<" ";
    }
}