#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <random>
#include <stdio.h>
#include <fstream>
#include <functional>
#include <atcoder/all>
using namespace std;
using namespace atcoder;

#define rep(i,n,c) for (int i=0;i<n;i+=c)
#define append push_back
#define all(x) (x).begin(), (x).end()

template<class T>
using vec = vector<T>;
template<class T>
using vvec = vec<vec<T>>;
template<class T>
using vvvec = vec<vvec<T>>;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;


template<class T>
bool chmin(T &a, T b){
  if (a>b){
    a = b;
    return true;
  }
  return false;
}

template<class T>
bool chmax(T &a, T b){
  if (a<b){
    a = b;
    return true;
  }
  return false;
}

template<class T>
T sum(vec<T> x){
  T res=0;
  for (auto e:x){
    res += e;
  }
  return res;
}

template<class T>
void printv(vec<T> x){
  for (auto e:x){
    cout<<e<<" ";
  }
  cout<<"\n";
}


int main(){
  int N,K;
  cin>>N>>K;
  mcf_graph<ll,ll> G(N);
  vec<ll> A(N);
  ll INF_COST = 2000000000;
  int M,b;
  for (int i=0;i<N;i++){
    cin>>A[i]>>M;
    for (int j=0;j<M;j++){
      cin>>b;
      G.add_edge(b-1,i,1,A[b-1]-A[i]+INF_COST*(i-b+1));
    }
    if (i!=N-1){
      G.add_edge(i,i+1,K,INF_COST);
    }
  }
  auto f = G.flow(0,N-1,K);
  assert (f.first==K);
  ll res = INF_COST*K*(N-1) - f.second;
  cout<<res<<endl;
}