#include <bits/stdc++.h> #define INF 3e9 #define pii pair<int, int> #define vec vector<int> using namespace std; vec vis; vector<vec> G; int n, k; long long res = INF; void BFS(int w) { long long ans = k; int start = w, countEdge = 1; queue<pii> q; q.push({ w, 1 }), vis[w] = start; while (!q.empty()) { int u = q.front().first; int x = q.front().second; q.pop(); for (int i = 0; i < (int)G[u].size(); i++) { int v = G[u][i]; if (vis[v] != start) { countEdge++; ans += (x + 1) * k; vis[v] = start; q.push({ v, x + 1 }); } } } res = (countEdge >= n ? min(res, 1LL * (ans)) : res); } int main() { cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0); // freopen("RESTRUCT.inp", "r", stdin); // freopen("RESTRUCT.out", "w", stdout); cin >> n >> k; vis.assign(n + 1, 0); G.assign(n + 1, vec()); for (int m, u = 1; u <= n; u++) { cin >> m; for (int v, i = 0; i < m; ++i) { cin >> v; G[v].push_back(u); } } for (int u = 1; u <= n; u++) BFS(u); cout << res; }