#include <bits/stdc++.h>
using namespace std;
template <class F> class y_combinator {
    F f;

   public:
    y_combinator(F&& f) : f(std::forward<F>(f)) {}
    template <class... Args> auto operator()(Args&&... args) const { return f(*this, std::forward<Args>(args)...); }
};
using ll = long long;
using ld = long double;
template <class T, class U = std::less<T>> using prique = std::priority_queue<T, std::vector<T>, U>;
template <class T> T floor(T a, T b) noexcept { return a / b - (a % b && (a ^ b) < 0); }
template <class T> T ceil(T a, T b) noexcept { return floor(a + b - 1, b); }
template <class T> bool chmin(T& x, const T& y) noexcept { return (x > y ? x = y, true : false); }
template <class T> bool chmax(T& x, const T& y) noexcept { return (x < y ? x = y, true : false); }
#define overload4(a, b, c, d, e, ...) e
#define rep1(a) for (long long _i = 0; _i < (a); _i++)
#define rep2(i, a) for (long long i = 0; i < (a); i++)
#define rep3(i, a, b) for (long long i = (a); i < (b); i++)
#define rep4(i, a, b, c) for (long long i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i, a, b, c) for (long long i = (a); i > (b); i += (c))
#define all(x) std::begin(x), std::end(x)
#define rall(x) std::rbegin(x), std::rend(x)
#define pb push_back
#ifndef LOCAL
#define debug(...)
#endif

#include <atcoder/maxflow>
void run_case() {
    int N, M;
    cin >> N >> M;
    vector<int> K(N), C(N);
    vector<vector<int>> A(N), B(N), idx(N);
    int sum = 0;
    int id = 0;
    rep(i, N) {
        cin >> K[i] >> C[i];
        sum += K[i];
        A[i].resize(K[i]);
        B[i].resize(K[i]);
        idx[i].resize(K[i]);
        rep(j, K[i]) cin >> A[i][j], A[i][j]--;
        rep(j, K[i]) cin >> B[i][j];
        rep(j, K[i]) idx[i][j] = id + j;
        id += K[i];
    }
    const int SRC = N;
    const int SNK = N + 1;
    const ll INF = 1e18;
    atcoder::mf_graph<ll> G(N + 2 + sum);
    ll tot = 0;
    rep(i, N) {
        tot += M;
        G.add_edge(SRC, i, M);
    }
    const int OFFSET = N + 2;
    rep(i, N) {
        rep(j, K[i]) {
            G.add_edge(idx[i][j] + OFFSET, A[i][j], INF);
            G.add_edge(idx[i][j] + OFFSET, i, INF);
            tot += B[i][j];
            G.add_edge(SRC, idx[i][j] + OFFSET, B[i][j]);
        }
    }
    rep(i, N) {
        G.add_edge(i, SNK, C[i]);
    }
    ll ans = tot - G.flow(SRC, SNK);
    cout << ans << "\n";
}
int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::fixed(std::cout).precision(16);
    int T = 1;
    while (T--) run_case();
    return 0;
}