import sys
from collections import deque


class Dinic:
    """https://tjkendev.github.io/procon-library/python/max_flow/dinic.html から拝借しています。"""

    def __init__(self, N):
        self.N = N
        self.G = [[] for i in range(N)]

    def add_edge(self, fr, to, cap):
        forward = [to, cap, None]
        forward[2] = backward = [fr, 0, forward]
        self.G[fr].append(forward)
        self.G[to].append(backward)

    def add_multi_edge(self, v1, v2, cap1, cap2):
        edge1 = [v2, cap1, None]
        edge1[2] = edge2 = [v1, cap2, edge1]
        self.G[v1].append(edge1)
        self.G[v2].append(edge2)

    def bfs(self, s, t):
        self.level = level = [None] * self.N
        deq = deque([s])
        level[s] = 0
        G = self.G
        while deq:
            v = deq.popleft()
            lv = level[v] + 1
            for w, cap, _ in G[v]:
                if cap and level[w] is None:
                    level[w] = lv
                    deq.append(w)
        return level[t] is not None

    def dfs(self, v, t, f):
        if v == t:
            return f
        level = self.level
        for e in self.it[v]:
            w, cap, rev = e
            if cap and level[v] < level[w]:
                d = self.dfs(w, t, min(f, cap))
                if d:
                    e[1] -= d
                    rev[1] += d
                    return d
        return 0

    def flow(self, s, t):
        flow = 0
        INF = 10 ** 18
        while self.bfs(s, t):
            *self.it, = map(iter, self.G)
            f = INF
            while f:
                f = self.dfs(s, t, INF)
                flow += f
        return flow


input = sys.stdin.buffer.readline

N, M = map(int, input().split())

ans = 0
dinic = Dinic(N + 2)
for i in range(1, N + 1):
    k, C = map(int, input().split())
    ans += M
    b_sum = 0
    if k:
        A = map(int, input().split())
        B = map(int, input().split())
        for a, b in zip(A, B):
            ans += b
            dinic.add_edge(i, a, b)
            b_sum += b
    dinic.add_edge(0, i, M + b_sum)
    dinic.add_edge(i, N + 1, C)

ans -= dinic.flow(0, N + 1)
print(ans)