#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

namespace {

void pre(std::vector<int>& l, std::vector<int>& r) {
  const int n = len(l);
  std::vector<int> order(n);
  std::iota(order.begin(), order.end(), 0);
  ranges::sort(order, {}, $(l[$1]));
  const auto old_l = l;
  const auto old_r = r;
  for (const int i : rep(n)) {
    l[i] = old_l[order[i]];
    r[i] = old_r[order[i]];
  }
}

void solve() {
  int n, m;
  scan(n, m);
  std::vector<int> l(n), r(n);
  for (const int i : rep(n)) {
    scan(l[i], r[i]);
  }
  std::vector<int> L(m), R(m);
  for (const int i : rep(m)) {
    scan(L[i], R[i]);
  }
  int k;
  scan(k);
  std::vector<int> p(k);
  scan(p);
  pre(l, r);
  pre(L, R);
  for (const int i : rep(n - 1)) {
    if (l[i + 1] <= r[i]) {
      print(std::vector(k, 1));
      return;
    }
  }
  for (const int i : rep(m - 1)) {
    if (L[i + 1] <= R[i]) {
      print(std::vector(k, 1));
      return;
    }
  }

  std::vector<int> ans(k);
  for (const int ki : rep(k)) {
    const i64 x = p[ki];
    for (const int j : rep(m)) {
      const int y = static_cast<int>(ranges::lower_bound(r, x * 2 - R[j]) - r.begin());
      const int z = static_cast<int>(ranges::upper_bound(l, x * 2 - L[j]) - l.begin()) - 1;
      if (y <= z) {
        ans[ki] = 1;
        break;
      }
    }
  }

  print(ans);
}

}  // namespace

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  std::cout << std::setprecision(DBL_DECIMAL_DIG);

  solve();
}

#else  // __INCLUDE_LEVEL__

#include <bits/stdc++.h>

template <class T, class U = T>
bool chmin(T& x, U&& y) {
  return y < x && (x = std::forward<U>(y), true);
}

template <class T, class U = T>
bool chmax(T& x, U&& y) {
  return x < y && (x = std::forward<U>(y), true);
}

template <std::signed_integral T = int>
T inf() {
  T ret;
  std::memset(&ret, 0x3f, sizeof(ret));
  return ret;
}

template <std::floating_point T>
T inf() {
  return std::numeric_limits<T>::infinity();
}

template <class T>
concept Range = std::ranges::range<T> && !std::convertible_to<T, std::string_view>;

template <class T>
concept Tuple = std::__is_tuple_like<T>::value && !Range<T>;

namespace std {

istream& operator>>(istream& is, Range auto&& r) {
  for (auto&& e : r) {
    is >> e;
  }
  return is;
}

istream& operator>>(istream& is, Tuple auto&& t) {
  return apply([&](auto&... xs) -> istream& { return (is >> ... >> xs); }, t);
}

ostream& operator<<(ostream& os, Range auto&& r) {
  for (string_view sep = ""; auto&& e : r) {
    os << exchange(sep, " ") << e;
  }
  return os;
}

ostream& operator<<(ostream& os, Tuple auto&& t) {
  const auto f = [&](auto&... xs) -> ostream& {
    [[maybe_unused]] string_view sep = "";
    ((os << exchange(sep, " ") << xs), ...);
    return os;
  };
  return apply(f, t);
}

}  // namespace std

void scan(auto&&... xs) { std::cin >> std::tie(xs...); }
void print(auto&&... xs) { std::cout << std::tie(xs...) << '\n'; }

#define $(...) \
  [&]<class T1 = int, class T2 = int>([[maybe_unused]] T1&& $1 = 0, [[maybe_unused]] T2&& $2 = 0) \
      ->decltype(auto) { \
    return __VA_ARGS__; \
  }

template <class F>
class fix {
 public:
  explicit fix(F f) : f_(std::move(f)) {}

  decltype(auto) operator()(auto&&... xs) const {
    return f_(std::ref(*this), std::forward<decltype(xs)>(xs)...);
  }

 private:
  F f_;
};

inline auto rep(int l, int r) { return std::views::iota(std::min(l, r), r); }
inline auto rep(int n) { return rep(0, n); }
inline auto rep1(int l, int r) { return rep(l, r + 1); }
inline auto rep1(int n) { return rep(1, n + 1); }

namespace ranges = std::ranges;
namespace views = std::views;

using i64 = std::int64_t;

#define len(...) static_cast<int>(ranges::size(__VA_ARGS__))

#endif  // __INCLUDE_LEVEL__