#include <bits/stdc++.h>
using namespace std;
const long long N = ((1 << 20) + 10), INF = 0x3f3f3f3f3f3f3f3f, mod = 1e9 + 7;
struct node {
  long long x, k, sta;
  bool operator<(const node &next) const & { return k < next.k; }
} a[100 + 10];
long long dp[N];
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  long long n, m, b;
  cin >> n >> m >> b;
  for (long long i = 1; i <= n; i++) {
    cin >> a[i].x >> a[i].k;
    long long cnt, tmp;
    cin >> cnt;
    while (cnt--) {
      cin >> tmp;
      a[i].sta |= (1 << (tmp - 1));
    }
  }
  memset(dp, 0x3f, sizeof dp);
  long long ans = INF;
  dp[0] = 0;
  sort(a + 1, a + 1 + n);
  for (long long i = 1; i <= n; i++) {
    for (long long j = 0, up = (1 << m); j < up; j++) {
      dp[j | a[i].sta] = min(dp[j | a[i].sta], dp[j] + a[i].x);
      if ((j | a[i].sta) == up - 1) ans = min(ans, dp[up - 1] + a[i].k * b);
    }
  }
  if (ans == INF) ans = -1;
  cout << ans << "\n";
  return 0;
}
