#include<bits/stdc++.h>
#define int long long
#define pr pair<int,int>
#define mkp make_pair
#define pb push_back
#define It set<node>::iterator
using namespace std;
const int N=2e5+5;
int n,m,q;
vector<pr> ve;
inline int read(){
    int x=0;
    char c=getchar();
    while(c<'0'||c>'9')c=getchar();
    while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
    return x;
}
map<int,int> mp;
struct node{
    int l,r;
    mutable int v;
    const bool operator<(node x)const{return l<x.l;}
};
set<node> s;
inline It spl(int p){
    It it=s.lower_bound({p,0,0});
    if(it!=s.end()&&it->l==p)return it;
    it--;
    int l=it->l,r=it->r,v=it->v;
    s.erase(it);
    s.insert({l,p-1,v});
    return s.insert({p,r,v+p-l}).first;
}
inline void emg(int l,int r,int v){
    It ir=spl(r+1),il=spl(l);
    for(It it=il;it!=ir;it++)
        if(it->v>0)mp[v+(it->l)-l-(it->v)]+=(it->r)-(it->l)+1;
    s.erase(il,ir);s.insert({l,r,v});
}
inline int find(int x){
    if(x<ve[0].first)return ve[ve.size()-1].second;
    int l=0,r=ve.size()-1;
    while(l<=r){
        int mid=(l+r)>>1;
        if(ve[mid].first<=x)l=mid+1;
        else r=mid-1;
    }
    return ve[ve.size()-1].second-ve[r].second;
}
signed main(){
    n=read(),m=read(),q=read();
    s.insert({1,n,(int)-1e9});
    for(int i=1,num=1;i<=m;i++){
        int l=read(),r=read();
        emg(l,r,num);num+=r-l+1;
    }
    for(auto i=mp.begin();i!=mp.end();i++)ve.pb(*i);
    //for(pr v:ve)printf("%lld %lld\n",v.first,v.second);
    for(int i=1;i<(int)ve.size();i++)
        ve[i].second+=ve[i-1].second;
    while(q--){
        int x=read();
        printf("%lld ",find(x));
    }
    return 0;
}