#include <bits/stdc++.h>
#define int long long
#define pii pair<int, int>
#define pos first
#define tmp second
using namespace std;

struct Query {
    bool isReq;
    int val, s, id;
};

const int N = 2e5 + 42, INF = 1e15 + 42;

set<pii> tmp;
vector<Query> qry;
int n, m, q, lastTmp = 0, ans[N];

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin >> n >> m >> q;
    tmp.insert({n+1, INF});
    for(int i = 0; i < m; i++) {
        int l, r; cin >> l >> r;
        l--;
        auto it = tmp.lower_bound({l, 0});
        int pre = l, fstT = (*it).tmp - (*it).pos;
        while((*it).pos <= r) {
            qry.push_back({false, (*it).pos - pre, (lastTmp - l) - ((*it).tmp - (*it).pos) - 1, 0});
            pre = (*it).pos;
            tmp.erase(it);
            it = tmp.lower_bound({l, 0});
        }
        qry.push_back({false, r - pre, (lastTmp - l) - ((*it).tmp - (*it).pos) - 1, 0});
        tmp.insert({l, fstT + l});
        tmp.insert({r, lastTmp + r - l});
        lastTmp += r - l;
    }
    for(int i = 0; i < q; i++) {
        int s; cin >> s;
        qry.push_back({true, 0, s, i});
    }
    sort(qry.begin(), qry.end(),
    [](Query a, Query b) {
        if(a.s == b.s)
            return !a.isReq && b.isReq;
        return a.s > b.s;
    });

    int cumSum = 0;
    for(Query req : qry)
        if(req.isReq)
            ans[req.id] = cumSum;
        else
            cumSum += req.val;
    for(int i = 0; i < q; i++)
        cout << ans[i] << ' ';
    cout << '\n';
}