#include "bits/stdc++.h"
#include "atcoder/all"
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<long long, long long>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
P op(P a, P b) {
	if ((a.first + a.second) > (b.first + b.second)) return a;
	return b;
}
P e() { return { LINF * -1,LINF * -1 }; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, k; cin >> n >> k;
	vector<int>a(n);
	vector<vector<int>>b(n);
	rep(i, n) {
		cin >> a[i];
		int m; cin >> m;
		b[i].resize(m);
		rep(j, m) cin >> b[i][j];
	}
	vector<P>dp(n + 1);
	dp[0] = { 0,0 };
	rep(i, n)dp[i + 1] = { LINF * -1,a[i] };
	segtree<P, op, e>seg(dp);
	rep(i, n) {
		{
			// exchange
			long long mx = LINF * -1;
			rep(j, b[i].size())chmax(mx, seg.get(b[i][j]).first);
			chmax(mx, seg.get(i + 1).first);
			seg.set(i + 1, { mx,a[i] });
		}
		{
			// get coin
			long long mx = seg.get(i + 1).first;
			chmax(mx, seg.get(0).first - a[i]);
			seg.set(i + 1, { mx,a[i] });
		}
		{
			// get maney
			auto get = seg.prod(1, n + 1);
			long long mx = get.first + get.second;
			chmax(mx, seg.get(0).first);
			seg.set(0, { mx,0 });
		}
	}
	long long ans = LINF * -1;
	rep(i, n + 1)chmax(ans, seg.get(i).first);
	cout << ans << endl;
	return 0;
}