class topological_sort():
    #1-indexed
    #0-indexedはバグる
    def __init__(self,n):
        self.n=n
        self.root=[[] for _ in range(self.n+1)]
        self.deg=[0]*(self.n+1)
    def add(self,a,b):
        #有向辺 a->b の追加
        self.root[a].append(b)
        self.deg[b]+=1
    def const(self):
        #トポロジカルソートした結果を返す
        #不可能なら [] を返す
        deg2=self.deg[:]
        search=[]
        res=[]
        for i in range(1,self.n+1):
            if deg2[i]==0:search.append(i)
        while search:
            now=search.pop()
            res.append(now)
            for next in self.root[now]:
                deg2[next]-=1
                if deg2[next]==0:
                    search.append(next)
        if len(res)==self.n:
            return res
        return []



n,k=map(int,input().split())

tp=topological_sort(2*n+10)

root=[[] for i in range(2*n+11)]
a=[0]*(n+1)
add=n+1
for i in range(1,n+1):
    x,m=map(int,input().split())
    a[i]=x
    b=list(map(int,input().split()))
    for y in b:
        root[y+add].append((i+add,0))
        tp.add(y+add,i+add)

for i in range(1,n+1):
    root[i].append((i+1,0))
    tp.add(i,i+1)
    root[i].append((i+add,-a[i]))
    tp.add(i,i+add)
    root[i+add].append((i+1,a[i]))
    tp.add(i+add,i+1)

dp=[0]*(2*n+11)
top=tp.const()
top.reverse()
for x in top:
    dp[x]=0
    for y,c in root[x]:
        dp[x]=max(dp[x],dp[y]+c)

print(dp[1])