#include<iostream>
#include<vector>
#include<atcoder/maxflow>
using namespace std;

int main(){
    int n;
    long long m;
    cin >> n >> m;
    
    vector<int> k(n);
    vector<vector<int>> A(n);
    vector<vector<long long>> B(n);
    vector<long long> C(n);
    
    for(int i=0;i<n;i++){
        cin >> k[i] >> C[i];
        A[i].resize(k[i]);
        B[i].resize(k[i]);
        for(int j=0;j<k[i];j++)cin >> A[i][j], A[i][j]--;
        for(int j=0;j<k[i];j++)cin >> B[i][j];
    }


    long long sum=m*n;
    for(int i=0;i<n;i++)for(int j=0;j<k[i];j++){
        sum+=B[i][j];
    }

    atcoder::mf_graph<long long> g(n+2);
    for(int i=0;i<n;i++){
        g.add_edge(n,i,C[i]);
        
        long long now_cost=m;
        for(int j=0;j<k[i];j++)now_cost+=B[i][j];
        g.add_edge(i,n+1,now_cost);

        for(int j=0;j<k[i];j++){
            g.add_edge(A[i][j],i,B[i][j]);
        }
    }
    
    cout <<  sum-g.flow(n,n+1) << '\n';
}