#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, 1, -1, -1, -1, 1, 1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
template <class T>
inline T biton(T n, T pos) {
  return n | ((T)1 << pos);
}
template <class T>
inline T bitoff(T n, T pos) {
  return n & ~((T)1 << pos);
}
template <class T>
inline T ison(T n, T pos) {
  return (bool)(n & ((T)1 << pos));
}
template <class T>
inline T gcd(T a, T b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
template <typename T>
string NumberToString(T Number) {
  ostringstream second;
  second << Number;
  return second.str();
}
inline int nxt() {
  int aaa;
  scanf("%d", &aaa);
  return aaa;
}
inline long long int lxt() {
  long long int aaa;
  scanf("%lld", &aaa);
  return aaa;
}
inline double dxt() {
  double aaa;
  scanf("%lf", &aaa);
  return aaa;
}
template <class T>
inline T bigmod(T p, T e, T m) {
  T ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % m;
    p = (p * p) % m;
  }
  return (T)ret;
}
struct info {
  long long int x, k;
  int mi;
  bool operator<(const info& other) const { return k > other.k; }
} ar[105];
int n, m;
long long int b;
long long int dp[3][(1 << 20) + 10];
int x = 0;
long long int go(int pos, int mask) {
  if (mask == x) {
    return 0;
  }
  if (pos >= n) return (long long int)3e18;
  return dp[pos][mask];
}
long long int go() {}
int main() {
  n = nxt(), m = nxt();
  b = lxt();
  for (int i = 0; i < n; i++) {
    ar[i].x = lxt();
    ar[i].k = lxt();
    int t = nxt();
    while (t--) {
      int a = nxt();
      a--;
      ar[i].mi = biton(ar[i].mi, a);
    }
  }
  sort(ar, ar + n);
  for (int i = 0; i < m; i++) {
    x = biton(x, i);
  }
  int cur = 1;
  int prev = 0;
  for (int i = 0; i <= x; i++) dp[cur][i] = (long long int)3e18;
  for (int pos = n - 1; pos >= 0; pos--) {
    swap(cur, prev);
    for (int mask = x; mask >= 0; mask--) {
      dp[cur][mask] =
          min(go(prev, mask), (mask == 0 ? (ar[pos].k * b) : 0) +
                                  go(prev, mask | ar[pos].mi) + ar[pos].x);
    }
  }
  long long int res = dp[cur][0];
  if (res >= (long long int)3e18)
    printf("-1\n");
  else
    printf("%lld\n", res);
  return 0;
}
