import itertools
import sys
n = int(input())
fragments = []
lengthes = []
for i in range(n):
    amount, length = map(int, input().split())
    lengthes.append(length)
    fragments.append(list(map(int, input().split())))
    if len(fragments[-1]) > 2:
        frag_distance = fragments[-1][1] - fragments[-1][0]
        for i in range(1, len(fragments[-1])):
            if fragments[-1][i] - fragments[-1][i - 1] != frag_distance:
                print("NO")
                sys.exit(0)
for permutation in itertools.permutations(range(n)):
    current = []
    current_length = 0
    for element in permutation:
        current.extend(map(lambda x: x + current_length, fragments[element]))
        current_length += lengthes[element]
    current_distance = current[1] - current[0]
    flag = True
    for i in range(1, len(current)):
        if current[i] - current[i - 1] != current:
            flag = False
            break
    if flag:
        print("YES")
        sys.exit(0)
print("NO")