#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i,n)for (int i = 0; i < int(n); ++i)
#define rrep(i,n)for (int i = int(n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) {a = max(a, b);}
template<class T> void chmin(T& a, const T& b) {a = min(a, b);}
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, k;
    cin >> n >> k;
    VI a(n);
    mcf_graph<int, ll> g(n);
    VL pot(n);
    const ll INF = 1001001001;
    rep(i, n) pot[i] = i * INF;
    rep(i, n - 1) g.add_edge(i, i + 1, k, INF);
    rep(i, n) {
        int m;
        cin >> a[i] >> m;
        rep(_, m) {
            int b;
            cin >> b;
            b--;
            g.add_edge(b, i, 1, pot[i] - pot[b] + a[b] - a[i]);
        }
    }
    auto [_, cost] = g.flow(0, n - 1, k);
    ll ans = -(cost - k * (pot[n - 1] - pot[0]));
    cout << ans << endl;
}