#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
const int N = 2e5+1;
int n, m, k, t, c, i, q;
cin>>n>>m>>k;
int a[N] = {0};
for(i = 0;i < n;i++)
{
cin>>t>>c;
int x=t+1-k-c,y=t-k;
if(y<=0) continue;
x = max(1,x);
a[x]++;
a[y+1]--;
}
for(i = 1;i <= 2e5;i++)
a[i]+=a[i-1];
for(;m > 0;m--)
{
cin>>q;
cout<<a[q]<<endl;
}
return 0;
}