#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
struct _ {
  ios_base::Init i;
  _() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); }
} _;
int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, -1, 1, 1, -1};
int main() {
  long long n, m, b;
  cin >> n >> m >> b;
  vector<pair<pair<long long, long long>, long long>> v;
  for (long long i = 0; i <= n - 1; i++) {
    long long x, k, mi;
    cin >> x >> k >> mi;
    long long curr_mask = 0;
    for (long long j = 1; j <= mi; j++) {
      long long mj;
      cin >> mj;
      curr_mask |= (1ll << (mj - 1ll));
    }
    v.push_back({{k, x}, curr_mask});
  }
  sort(v.begin(), v.end());
  long long ans = LLONG_MAX;
  vector<long long> dp(1 << m, LLONG_MAX);
  dp[0] = 0;
  for (auto curr : v) {
    for (long long mask = (1 << m) - 1; mask >= 0; mask--) {
      if (dp[mask] == LLONG_MAX) continue;
      dp[mask | curr.second] =
          min(dp[mask | curr.second], dp[mask] + curr.first.second);
    }
    if (dp[(1 << m) - 1] != LLONG_MAX)
      ans = min(ans, dp[(1 << m) - 1] + b * curr.first.first);
  }
  cout << ((ans == LLONG_MAX) ? -1 : ans);
  return 0;
}
