#include <bits/stdc++.h>
using namespace std;
long long delbit(long long a, long long k) { return a & (~(1 << k)); }
int delbit(int a, int k) { return a & (~(1 << k)); }
bool getbit(long long a, long long k) { return 1 & (a >> k); }
bool getbit(int a, int k) { return 1 & (a >> k); }
long long setbit(long long a, long long k) { return a |= (1 << k); }
int setbit(int a, int k) { return a |= (1 << k); }
inline long long mulmod(long long first, long long n, long long _mod) {
  long long res = 0;
  while (n) {
    if (n & 1) res = (res + first) % _mod;
    first = (first + first) % _mod;
    n >>= 1;
  }
  return res;
}
inline long long powmod(long long first, long long n, long long _mod) {
  long long res = 1;
  while (n) {
    if (n & 1) res = (res * first) % _mod;
    first = (first * first) % _mod;
    n >>= 1;
  }
  return res;
}
inline long long gcd(long long a, long long b) {
  long long t;
  while (b) {
    a = a % b;
    t = a;
    a = b;
    b = t;
  }
  return a;
}
inline int gcd(int a, int b) {
  int t;
  while (b) {
    a = a % b;
    t = a;
    a = b;
    b = t;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long gcd(long long a, long long b, long long c) {
  return gcd(gcd(a, b), c);
}
inline int gcd(int a, int b, int c) { return gcd(gcd(a, b), c); }
double dist(double ax, double ay, double bx, double by) {
  return sqrt(((ax - bx) * (ax - bx)) + ((ay - by) * (ay - by)));
}
template <typename T, typename T2>
void printarr(T a[], T2 sz, T2 beg = 0) {
  for (T2 i = beg; i < sz; i++) cout << a[i] << " ";
  cout << endl;
}
long long dp[1 << 21];
struct S {
  int t;
  long long first;
  long long k;
} f[111];
bool comp(S a, S b) { return a.k < b.k; }
const long long inf = 1e11 + 10002;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, m;
  long long b;
  cin >> n >> m >> b;
  for (int(i) = (0); (i) < (n); (i)++) {
    cin >> f[i].first >> f[i].k;
    int l;
    cin >> l;
    while (l--) {
      int a;
      cin >> a;
      f[i].t |= (1 << (a - 1));
    }
  }
  for (int(j) = (0); (j) < (1 << m); (j)++) {
    dp[j] = 1000111000111000111LL;
  }
  dp[0] = 0;
  sort(f, f + n, comp);
  long long ans = 1000111000111000111LL;
  for (int(i) = (0); (i) < (n); (i)++) {
    for (int(j) = (0); (j) < (1 << m); (j)++) {
      dp[j | f[i].t] = min(dp[j | f[i].t], dp[j] + f[i].first);
    }
    ans = min(ans, dp[(1 << m) - 1] + f[i].k * b);
  }
  if (ans != 1000111000111000111LL)
    cout << ans << endl;
  else
    cout << "-1\n";
  return 0;
}
