#pragma GCC optimize("O2")
#include <algorithm>
#include <array>
#include <bit>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <compare>
#include <complex>
#include <concepts>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numbers>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ranges>
#include <set>
#include <span>
#include <sstream>
#include <stack>
#include <streambuf>
#include <string>
#include <tuple>
#include <type_traits>
#include <variant>

#define int ll
#define INT128_MAX (__int128)(((unsigned __int128) 1 << ((sizeof(__int128) * __CHAR_BIT__) - 1)) - 1)
#define INT128_MIN (-INT128_MAX - 1)

#define clock chrono::steady_clock::now().time_since_epoch().count()

#ifdef DEBUG
#define dbg(x) cout << (#x) << " = " << x << '\n'
#else
#define dbg(x)
#endif

namespace R = std::ranges;
namespace V = std::views;

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ldb = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
//#define double ldb

template<class T>
ostream& operator<<(ostream& os, const pair<T, T> pr) {
  return os << pr.first << ' ' << pr.second;
}
template<class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N> &arr) {
  for(const T &X : arr)
    os << X << ' ';
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T> &vec) {
  for(const T &X : vec)
    os << X << ' ';
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const set<T> &s) {
  for(const T &x : s)
    os << x << ' ';
  return os;
}

array<int, 2> operator+(array<int, 2> l, array<int, 2> r) {
  return {l[0] + r[0], l[1] + r[1]};
}
array<int, 2> operator-(array<int, 2> l, array<int, 2> r) {
  return {l[0] - r[0], l[1] - r[1]};
}

int myfloor(int a, int b) {
  if (b < 0) a *= -1, b *= -1;
  if (a >= 0) return a / b;
  else return (a - (b - 1)) / b;
}

int myceil(int a, int b) {
  if (b < 0) a *= -1, b *= -1;
  if (a >= 0) return (a + b - 1) / b;
  else return a / b;
}

signed main() {
  ios::sync_with_stdio(false), cin.tie(NULL);

  int n, k; cin >> n >> k;
  vector<array<int, 2>> rx(n);
  for(auto &[r, x] : rx) {
    cin >> r >> x;
    r--;
  }

  for(int i = 0; i < n; i++) {
    vector<array<int, 2>> b(n), suf(n + 1);
    b[i] = suf[i] = {0, 1};
    for(int j = n - 1; j >= 0; j--) {
      if (i != j)
        b[j] = array<int, 2>{rx[j][1], 0} - (suf[j + 1] - suf[rx[j][0] + 1]); 
      suf[j] = b[j] + suf[j + 1];
    }
    dbg(suf);
    dbg(b);

    bool ok = true;
    int l = 0, r = k;
    for(int j = 0; j < n; j++) {
      auto [d, c] = b[j];
      if (c == 0) {
        ok = ok and 0 <= d and d <= k;
      } else {
        if (c > 0)
          r = min(r, myfloor(k - d, c)), l = max(l, myceil(-d, c));
        else
          l = max(l, myceil(k - d, c)), r = min(r, myfloor(-d, c));
        dbg(l);
        dbg(r);
      }
    }

    if (ok and l <= r)
      cout << "Yes\n";
    else
      cout << "No\n";
  }

  return 0;
}