The sample implementation in the official editorial seems a bit difficult, so I will post a code with fewer lines.

(Python)

N, M = map(int, input().split())
P, C, F = [], [], []
for _ in range(N):
    l = list(map(int, input().split()))
    P.append(l[0])
    C.append(l[1])
    F.append(set(l[2:]))
ans = False
for i in range(N):
    for j in range(N):
        ans |= P[i] >= P[j] and F[j].issuperset(F[i]) \
            and (P[i] > P[j] or len(F[j]) > len(F[i]))
print('Yes' if ans else 'No')