#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef double db;


struct fish
{
	int x, y, i;
	
	bool operator<(const fish& f) const
	{
		return MP(x - y, i) < MP(f.x - f.y, f.i);
	}
};

int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	
	int n, m, l;
	cin >> n >> m >> l;
	vector<PII> f(n);
	FOR (i, 0, n)
		cin >> f[i].F >> f[i].S;
	sort(ALL(f), [](PII a, PII b)
	{
		return a.F + a.S < b.F + b.S;
	});
	set<fish> s;
	VI a(m);
	FOR (i, 0, m)
		cin >> a[i];
	VI idx(m);
	iota(ALL(idx), 0);
	sort(ALL(idx), [&a](int i, int j)
	{
		return a[i] < a[j];
	});
	VI ans(m);
	int j = 0;
	for (auto i : idx)
	{
		//cerr << i << ' ' << j << ' ' << f[j].F + f[j].S << ' ' << a[i] + l << '\n';
		while (j < n && f[j].F + f[j].S <= a[i] + l)
		{
			s.insert({f[j].F, f[j].S, j});
			j++;
		}
		while (!s.empty())
		{
			fish p = *s.begin();
			if (p.x - p.y < a[i] - l)
				s.erase(s.begin());
			else
				break;
		}
		ans[i] = SZ(s);
	}
	FOR (i, 0, m)
	{
		cout << ans[i] << '\n';
	}
	return 0;
}