ソースコード
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "math.h"
#include "utility"
#include "string"
#include "map"
#include "unordered_map"
#include "iomanip"
#include "random"
using namespace std;
const long long int MOD = 1000000007;
long long int power(long long int x, long long int n, long long int M) {
long long int tmp = 1;
if (n > 0) {
tmp = power(x, n / 2, M);
if (n % 2 == 0) tmp = (tmp*tmp) % M;
else tmp = (((tmp*tmp) % M)*x) % M;
}
return tmp;
}
long long int N, M, K, Q, W, H, L, R;
long long int ans;
int main() {
ios::sync_with_stdio(false);
cin >> N >> K >> Q;
long long int num[100002] = {};
int dir[100002] = {};
for (int i = 1; i <= N; i++)cin >> num[i] >> dir[i];
for (int i = 1; i < N; i++) {
if (dir[i] == 1 && dir[i + 1] == 2) {
//cout << i << endl;
// cout << num[i] << " " << num[i + 1] << endl;
long long int box, bag;
box = min(num[i] + K, (num[i] + num[i + 1]) / 2);
bag = max(num[i + 1] - K, (num[i] + num[i + 1]) / 2);
num[i] = box;
num[i + 1] = bag;
// cout << num[i] << " " << num[i + 1] << endl;
int loop = i - 1;
while (dir[loop] == 1) {
num[loop] = min(num[loop] + K, num[i]);
loop--;
// cout << i << endl;
}
loop = i + 2;
while (dir[loop] == 2) {
num[loop] = max(num[loop] - K, num[i + 1]);
loop++;
// cout << i << endl;
}
}
}
int loop = 1;
while (dir[loop] == 2) {
num[loop] -= K;
loop++;
}
loop = N;
while (dir[loop] == 1) {
num[loop] += K;
loop--;
}
//for (int i = 1; i <= N; i++)cout << num[i] << endl;
for (int i = 1; i <= Q; i++) {
cin >> M;
cout << num[M] << endl;
}
return 0;
}