#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const long long inf = 2147383647;
const double pi = 2 * acos(0.0);
const double eps = 1e-9;
struct debugger {
  template <typename T>
  debugger &operator,(const T &v) {
    cerr << v << " ";
    return *this;
  }
} dbg;
inline long long gcd(long long a, long long b) {
  a = ((a) < 0 ? -(a) : (a));
  b = ((b) < 0 ? -(b) : (b));
  while (b) {
    a = a % b;
    swap(a, b);
  }
  return a;
}
long long ext_gcd(long long A, long long B, long long *X, long long *Y) {
  long long x2, y2, x1, y1, x, y, r2, r1, q, r;
  x2 = 1;
  y2 = 0;
  x1 = 0;
  y1 = 1;
  for (r2 = A, r1 = B; r1 != 0;
       r2 = r1, r1 = r, x2 = x1, y2 = y1, x1 = x, y1 = y) {
    q = r2 / r1;
    r = r2 % r1;
    x = x2 - (q * x1);
    y = y2 - (q * y1);
  }
  *X = x2;
  *Y = y2;
  return r2;
}
inline long long modInv(long long a, long long m) {
  long long x, y;
  ext_gcd(a, m, &x, &y);
  if (x < 0) x += m;
  return x;
}
inline long long power(long long a, long long p) {
  long long res = 1, x = a;
  while (p) {
    if (p & 1) res = (res * x);
    x = (x * x);
    p >>= 1;
  }
  return res;
}
inline long long bigmod(long long a, long long p, long long m) {
  long long res = 1 % m, x = a % m;
  while (p) {
    if (p & 1) res = (res * x) % m;
    x = (x * x) % m;
    p >>= 1;
  }
  return res;
}
using namespace std;
template <typename T>
ostream &operator<<(ostream &out, vector<T> v) {
  out << "[ ";
  for (int i = 0; i < (((int)(v).size())); i++) {
    if (i) out << ", ";
    out << v[i];
  }
  out << " ]";
  return out;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &out, pair<T1, T2> p) {
  out << "( " << p.first << ", " << p.second << ")";
  return out;
}
template <typename T>
ostream &operator,(ostream &out, T x) {
  out << x << " ";
  return out;
}
struct Person {
  long long reqMonitor;
  long long reqMoney;
  int mask;
  bool operator<(const Person &other) const {
    return reqMonitor < other.reqMonitor;
  }
};
int finalMask;
int N, M;
long long monitorCost;
Person friends[107];
long long dpA[1 << 21], dpB[1 << 21];
long long solve() {
  sort(friends, friends + N);
  finalMask = (1 << M) - 1;
  for (int i = 0; i <= finalMask; i++) {
    dpA[i] = (1LL << 62);
  }
  long long *curDPptr = dpA;
  long long *nxtDPptr = dpB;
  for (int i = N - 1; i >= 0; i--) {
    swap(curDPptr, nxtDPptr);
    for (int mask = 0; mask <= finalMask; mask++) {
      curDPptr[i] = (1LL << 62);
    }
    for (int mask = 0; mask < finalMask; mask++) {
      int newMask = mask | friends[i].mask;
      if (newMask == finalMask) {
        curDPptr[mask] =
            friends[i].reqMoney + friends[i].reqMonitor * monitorCost;
      } else {
        curDPptr[mask] = friends[i].reqMoney + nxtDPptr[newMask];
      }
      curDPptr[mask] = ((curDPptr[mask]) < (nxtDPptr[mask]) ? (curDPptr[mask])
                                                            : (nxtDPptr[mask]));
    }
  }
  long long ret = curDPptr[0];
  if (ret == (1LL << 62)) return -1;
  return ret;
}
int main() {
  scanf("%d %d %lld", &N, &M, &monitorCost);
  int k, x;
  for (int i = 0; i < (N); i++) {
    scanf("%lld %lld %d", &friends[i].reqMoney, &friends[i].reqMonitor, &k);
    friends[i].mask = 0;
    while (k--) {
      scanf("%d", &x);
      x--;
      friends[i].mask |= (1 << x);
    }
  }
  printf("%lld\n", solve());
  return 0;
}
