#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

ll N, T, Q;
ll A[100100], D[100100];
ll B[100100];

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    std::cin >> N >> T >> Q;

    for(int i=1;i<=N;++i){
        std::cin >> A[i] >> D[i];
    }

    int i = 1;
    while(i <= N && D[i] == 2){
        B[i] = A[i] - T;
        ++i;
    }

    for(int j=i;i<=N;){
        while(j <= N && D[j] == 1){
            ++j;
        }

        if(j <= N){
            ll x = (A[j-1] + A[j]) / 2;
            while(i < j){
                B[i] = min(A[i] + T, x);
                ++i;
            }

            while(j <= N && D[j] == 2){
                B[j] = max(A[j] - T, x);
                ++j;
            }

            i = j;
        }else{
            while(i <= N){
                B[i] = A[i] + T;
                ++i;
            }
        }
    }

    for(int i=0;i<Q;++i){
        int X;
        std::cin >> X;

        std::cout << B[X] << std::endl;
    }
}

