#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; }
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];
		rep(j, m) b[i][j]--;
	}
	vector<long long>p(n, LINF);
	p[0] = 0;
	rep(i, n) {
		if (0 != i)chmin(p[i], p[i - 1]);
		rep(j, b[i].size()) {
			chmin(p[i], p[b[i][j]] + (a[b[i][j]] - a[i]));
		}
	}
	int s = 0;
	int t = n - 1;
	int c = 0;
	mcf_graph<long long, long long> g(t + 1);
	rep(i, n) {
		rep(j, b[i].size()) {
			g.add_edge(b[i][j], i, 1, (a[b[i][j]] - a[i]) + p[b[i][j]] - p[i]);
			c++;
		}
		if ((n - 1) != i) {
			g.add_edge(i, i + 1, k, 0LL + p[i] - p[i + 1]);
			c++;
		}
	}
	g.flow(s, t, k).second;
	long long ans = 0;
	rep(i, c) {
		int in = g.get_edge(i).from;
		int out = g.get_edge(i).to;
		long long pin = p[in];
		long long pout = p[out];
		ans -= g.get_edge(i).flow * (g.get_edge(i).cost - pin + pout);
	}
	cout << ans << endl;
	return 0;
}