import sys from itertools import permutations from heapq import heappop,heappush from collections import deque import random import bisect input = lambda :sys.stdin.readline().rstrip() mi = lambda :map(int,input().split()) li = lambda :list(mi()) class UnionFindVerSize(): def __init__(self, N): self._parent = [n for n in range(0, N)] self._size = [1] * N self.group = N def find_root(self, x): if self._parent[x] == x: return x self._parent[x] = self.find_root(self._parent[x]) return self._parent[x] def unite(self, x, y): gx = self.find_root(x) gy = self.find_root(y) if gx == gy: return self.group -= 1 if self._size[gx] < self._size[gy]: self._parent[gx] = gy self._size[gy] += self._size[gx] else: self._parent[gy] = gx self._size[gx] += self._size[gy] def get_size(self, x): return self._size[self.find_root(x)] def is_same_group(self, x, y): return self.find_root(x) == self.find_root(y) N,K = mi() cond = [] for _ in range(N): r,x = mi() cond.append((r,x)) res = [] for i in range(N): tmp = [(0,0)] * (N+1) for j in range(N)[::-1]: if j!=i: r,x = cond[j] """ A_j + tmp[j+1] - tmp[r] = X[j] """ a,b = -(tmp[j+1][0] - tmp[r][0]),x-(tmp[j+1][1] - tmp[r][1]) tmp[j] = (tmp[j+1][0]+a,tmp[j+1][1]+b) else: tmp[j] = (tmp[j+1][0]+1,tmp[j+1][1]) #print(tmp) l,r = 0,K for j in range(N): a,b = tmp[j][0]-tmp[j+1][0],tmp[j][1]-tmp[j+1][1] #print(a,b) if a == 0: if not 0 <= b <= K: res.append("No") break elif 0 < a: l = max(l,(-b+a-1)//a) r = min(r,(K-b)//a) else: r = min(r,(b)//(-a)) l = max(l,(-K+b+(-a)-1)//(-a)) else: #print("lr",l,r) res.append("Yes" if l <= r else "No") print(*res,sep="\n")