#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <functional>

using namespace std;

#define int long long

#define fst first
#define scd second
#define PB push_back
#define MP make_pair
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define omajinai ios::sync_with_stdio(false);cin.tie(0)
#define rep(i,x) for(int i=0;i<(int)(x);++i)
#define rep1(i,x) for(int i=1;i<=(int)(x);++i)

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

template<typename T>T& max(T&a,T&b){if(a>=b)return a;return b;}
template<typename T>T& min(T&a,T&b){if(a<b)return a;return b;}
template<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<typename T>T get(){T a;cin>>a;return a;}
template<typename T>T rev(T a){reverse(all(a));return a;}
template<typename T>vector<T>&sort(vector<T>&a){sort(all(a));return a;}

const int inf = 1e9;
const ll linf = 3e18;
const double eps = 1e-9;

int A[100010], D[100010];

vector<int> kabe;

signed main()
{
	omajinai;

	int N, T, Q; cin >> N >> T >> Q;

	rep(i, N) {
		cin >> A[i] >> D[i];
	}

	rep(i, N - 1) {
		if (D[i] == 1 && D[i + 1] == 2) {
			kabe.PB((A[i] + A[i + 1]) / 2);
		}
	}

	rep(i, Q) {
		int x; cin >> x;
		-- x;

		if (D[x] == 1) {
			vi::iterator itr = upper_bound(all(kabe), A[x]);
			if (itr == kabe.end()) {
				cout << A[x] + T << endl;
			} else {
				cout << min(A[x] + T, *itr) << endl;
			}
		} else {
			vi::iterator itr = lower_bound(all(kabe), A[x]);

			if (itr == kabe.begin()) {
				cout << A[x] - T << endl;
			} else {
				itr -= 1;
				cout << max(A[x] - T, *itr) << endl;
			}
		}
	}
}