from fractions import Fraction
from collections import Counter

def line_ints(): return list(map(int, input().split()))


def get_line(p1, p2):
    v = [ p2[0] - p1[0], p2[1] - p1[1] ]
    S = [p1[0] + Fraction(v[0], 2), p1[1] + Fraction(v[1], 2)]
    v_ort = [-v[1], v[0]]
    S_dash = [ S[0] + v_ort[0], S[1] + v_ort[1] ]
    if S[0] == S_dash[0]:
        k = float("inf")
        b = S[0]
    else:
        k = Fraction( S[1] - S_dash[1], S[0] - S_dash[0] )
        if S[1] == S_dash[1]:
            b = S[1]
        else:
            b = S[1] - k * S[0]

    return k, b

n, p = line_ints()


points = []
for _ in range(n):
    points.append(line_ints())

lines = []
for i in range(n):
    for j in range(i + 1, n):
        lines.append(get_line(points[i], points[j]))


lines.sort()
c = Counter(lines)
top = max(c.values())

frac = top * 2 / len(points) * 100


if frac >= p:
    print("YES")
else:
    print("NO")

# get_line((0, 0), (1, 1))