import sys,random,bisect
from collections import deque,defaultdict,Counter
from heapq import heapify,heappop,heappush
from itertools import cycle, permutations
from math import log,gcd

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())



N,K = mi()

assert K == 3

star = [[] for p in range(2)]
for _ in range(N):
    x,y,c = mi()
    star[c-1].append((x,y))

for p in range(2):
    for x,y in star[p]:
        S = set()
        for xx,yy in star[p^1]:
            xx,yy = xx-x,yy-y
            g = gcd(xx,yy)
            xx,yy = xx//g,yy//g
            if (-xx,-yy) in S:
                exit(print("Yes"))
            S.add((xx,yy))

print("No")