#include <bits/stdc++.h>

using namespace std;

struct lamp {
  int x;
  int color;
};



struct lamp lamps[250000] = {};
int xAxis[250000] = {};

int main(void) {
  int n, q, maxX;
  cin >> n >> q;

  // Get all lamps
  for (int i = 1; i <= n; i++) {
    // Append lamp to lamps arr
    cin >> lamps[i].x >> lamps[i].color;
    // Place lamps in the x axis
    xAxis[lamps[i].x] = i;
    maxX = max(maxX, lamps[i].x);
  }

  // for (int x = 0; x < i; x++)
  //   printf("Lamps { x: %d, y: %d}\n", lamps[x].x, lamps[x].color);

  // Solve queries
  for (int i = 0; i < q; i++) {
    bool found = false;
    int d; cin >> d;

    // For i in lamp
    for (int j = 1; j <= n && !found; j++) {

      // Check if lamp id is in bounds
      if (lamps[j].x + d > maxX) continue;

      // Check if lamp is valid
      int otherLamp = xAxis[lamps[j].x + d];
      if (!otherLamp) continue;

      if (lamps[otherLamp].color != lamps[j].color) {
        cout << j << endl;
        found = true;
      }
    }

    if (!found)
      cout << 0 << endl;

  }

  return 0;
}