#include <bits/stdc++.h>
using namespace std;
long long int Powmod(long long int a, int b, int n) {
  long long int rm = 1;
  while (b) {
    if (b % 2) {
      rm = (rm * a) % n;
    }
    a = (a * a) % n;
    b /= 2;
  }
  return rm;
}
long long int dp[2][1048575 + 10], tdp[2][1048575 + 10], ans, b, k, x[101],
    Pow[100];
vector<pair<long long int, long long int> > v;
int main() {
  int t = 1, n, m, vv, q, cur[101];
  long long int limit = 1ll << 60;
  ans = (limit);
  dp[0][0] = 0;
  Pow[0] = 1;
  for (int i = 1; i <= 60; ++i) Pow[i] = Pow[i - 1] * 2;
  cin >> n >> m >> b;
  int lm = (1 << m) - 1;
  for (int i = 1; i <= lm; ++i) {
    dp[0][i] = limit;
  }
  for (int i = 1; i <= n; ++i) {
    cin >> x[i] >> k >> q;
    v.push_back(make_pair(k, i));
    cur[i] = 0;
    while (q--) {
      cin >> vv;
      cur[i] |= 1 << vv - 1;
    }
  }
  sort(v.begin(), v.end());
  t = 0;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j <= lm; ++j)
      dp[t][j | cur[v[i].second]] =
          min(dp[0][j | cur[v[i].second]], x[v[i].second] + dp[0][j]);
    ans = min(ans, v[i].first * b + dp[0][lm]);
  }
  cout << ((ans < (limit)) ? ans : -1) << endl;
  return 0;
}
