// pz2
// O(n*m + q)

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

#define int long long

const int mn = 2e5+7;
const int oo = 1e18+7;
int n,m,q;
int l[mn], r[mn], s[mn];
int ost[mn];
int wyn[mn];

int32_t main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>n>>m>>q;
    for (int i = 0; i < m; i++){
        cin>>l[i]>>r[i];
    }
    for (int i = 0; i < q; i++){
        cin>>s[i];
    }
    int ind = 0;
    for (int j = 1; j <= n; j++){
        ost[j] = oo;
    }
    for (int j = 0; j < m; j++){
        for (int k = l[j]; k <= r[j]; k++){
            // cerr<<k<<" ";
            ind++;
            if (ind - ost[k] > 0) wyn[ind-ost[k]-1]++;
            ost[k] = ind;
        }
    }
    for (int i = n*m; i >= 0; i--){
        wyn[i] += wyn[i+1];
    }
    for (int i = 0; i < q; i++){
        if (s[i] > n*m) cout<<"0 ";
        else cout<<wyn[i]<<" ";
    }
}