#include <bits/stdc++.h>
using namespace std;
long long const N = 100 + 20, SZ = (1 << 20) + 20, INF = (long long)2e18;
long long n, m, b, dp[SZ], x, y, all, ans, slv[N], cost[N];
pair<long long, long long> k[N];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> m >> b;
  all = (1LL << m) - 1;
  for (int i = 0; i < n; i++) {
    cin >> cost[i] >> k[i].first >> x;
    k[i].second = i;
    for (int j = 0; j < x; j++) {
      cin >> y;
      y--;
      slv[i] += (1LL << y);
    }
  }
  sort(k, k + n);
  fill(dp + 1, dp + all + 1, INF);
  ans = INF;
  for (int i = 0; i < n; i++) {
    for (int mask = all; ~mask; mask--)
      if (dp[mask] != INF)
        dp[mask | slv[k[i].second]] =
            min(dp[mask | slv[k[i].second]], dp[mask] + cost[k[i].second]);
    ans = min(ans, dp[all] + k[i].first * b);
  }
  return cout << (ans == INF ? -1 : ans), 0;
}
