#include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll arr[100001] = {0}; // array for points
vector<ll> solve(vector<vector<ll>>& lamps,vector<ll>& points){
vector<ll>ans(points.size());
// iterating on queries
for(ll i=0;i<lamps.size();i++){
ll L = lamps[i][0];
ll R = lamps[i][1];
arr[L] += 1;
arr[R+1] += -1;
}
// now doing prefix sum on points array
for(ll i=1;i<=100000;i++){
arr[i] += arr[i-1];
}
for(ll i=0;i<points.size();i++){
ans[i] = arr[points[i]];
}
return ans;
}
int main() {
ll q;
cin>>q;
ll n;
vector<vector<ll>>lamps(q,vector<ll>(2));
for(ll i=0;i<q;i++){
for(ll j=0;j<2;j++){
cin>>lamps[i][j];
}
}
cin>>n;
vector<ll>points(n);
for(ll i=0;i<n;i++){
cin>>points[i];
}
vector<ll>ans = solve(lamps,points);
for(int x:ans){
cout<<x<<" ";
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiNkZWZpbmUgbGwgbG9uZyBsb25nIGludAoKbGwgYXJyWzEwMDAwMV0gPSB7MH07ICAvLyBhcnJheSBmb3IgcG9pbnRzCgp2ZWN0b3I8bGw+IHNvbHZlKHZlY3Rvcjx2ZWN0b3I8bGw+PiYgbGFtcHMsdmVjdG9yPGxsPiYgcG9pbnRzKXsKCQoJdmVjdG9yPGxsPmFucyhwb2ludHMuc2l6ZSgpKTsKCQoJLy8gaXRlcmF0aW5nIG9uIHF1ZXJpZXMKCWZvcihsbCBpPTA7aTxsYW1wcy5zaXplKCk7aSsrKXsKCQlsbCBMID0gbGFtcHNbaV1bMF07CgkJbGwgUiA9IGxhbXBzW2ldWzFdOwoJCWFycltMXSArPSAxOwoJCWFycltSKzFdICs9IC0xOwoJfQoJCgkvLyBub3cgZG9pbmcgcHJlZml4IHN1bSBvbiBwb2ludHMgYXJyYXkKCWZvcihsbCBpPTE7aTw9MTAwMDAwO2krKyl7CgkJYXJyW2ldICs9IGFycltpLTFdOwoJfQoJCglmb3IobGwgaT0wO2k8cG9pbnRzLnNpemUoKTtpKyspewoJCWFuc1tpXSA9IGFycltwb2ludHNbaV1dOwoJfQoJcmV0dXJuIGFuczsKfQoKaW50IG1haW4oKSB7CglsbCBxOwoJY2luPj5xOwoJbGwgbjsKCXZlY3Rvcjx2ZWN0b3I8bGw+PmxhbXBzKHEsdmVjdG9yPGxsPigyKSk7Cglmb3IobGwgaT0wO2k8cTtpKyspewoJCWZvcihsbCBqPTA7ajwyO2orKyl7CgkJCWNpbj4+bGFtcHNbaV1bal07CgkJfQoJfQoJY2luPj5uOwoJdmVjdG9yPGxsPnBvaW50cyhuKTsKCWZvcihsbCBpPTA7aTxuO2krKyl7CgkJY2luPj5wb2ludHNbaV07Cgl9CgkKCXZlY3RvcjxsbD5hbnMgPSBzb2x2ZShsYW1wcyxwb2ludHMpOwoJCglmb3IoaW50IHg6YW5zKXsKCQljb3V0PDx4PDwiICI7Cgl9CglyZXR1cm4gMDsKfQ==