#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int fx[] = {+0, +1, +0, -1, +1, +1, -1, -1, +0};
int fy[] = {+1, +0, -1, +0, +1, -1, +1, -1, +0};
template <typename T>
inline T GCD(T a, T b) {
  a = abs(a);
  b = abs(b);
  if (a < b) swap(a, b);
  while (b) {
    a = a % b;
    swap(a, b);
  }
  return a;
}
template <typename T>
inline T EGCD(T a, T b, T &x, T &y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  }
  T x1, y1;
  T d = EGCD(b % a, a, x1, y1);
  x = y1 - (b / a) * x1;
  y = x1;
  return d;
}
template <typename T>
inline T LCM(T x, T y) {
  T tp = GCD(x, y);
  if ((x / tp) * 1. * y > 9e18) return 9e18;
  return (x / tp) * y;
}
template <typename T>
inline T BigMod(T A, T B, T M = MOD) {
  T ret = 1;
  while (B) {
    if (B & 1) ret = (ret * A) % M;
    A = (A * A) % M;
    B = B >> 1;
  }
  return ret;
}
template <typename T>
inline T InvMod(T A, T M = MOD) {
  return BigMod(A, M - 2, M);
}
template <typename T>
T scani(T &n) {
  n = 0;
  bool negative = false;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') negative = true;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    n = n * 10 + c - 48;
    c = getchar();
  }
  if (negative) n = ~(n - 1);
  return n;
}
template <typename T>
void write(T n, int type = true) {
  if (n < 0) {
    putchar('-');
    n = -n;
  }
  if (!n) {
    putchar('0');
    if (type == 32)
      putchar(' ');
    else if (type)
      putchar('\n');
    return;
  }
  char buff[22];
  int len = 0;
  while (n) buff[len++] = n % 10 + 48, n /= 10;
  for (int i = len - 1; i >= 0; i--) putchar(buff[i]);
  if (type == 32)
    putchar(' ');
  else if (type)
    putchar('\n');
}
int scans(char *a) {
  int i = 0;
  char c = 0;
  while (c < 33) c = getchar();
  while (c > 33) {
    a[i++] = c;
    c = getchar();
  }
  a[i] = 0;
  return i;
}
const int N = 105;
long long n, m, b, limit;
long long dp[(1 << 20) + 10];
struct data {
  long long money;
  long long monitor, Pn;
  int sMask;
  data() {}
  data(long long a, long long x, long long c) {
    money = a;
    monitor = x;
    Pn = c;
    sMask = 0;
  }
  bool operator<(const data &yoo) const { return monitor > yoo.monitor; }
} in[N];
int main() {
  set<int> st;
  memset(dp, -1, sizeof(dp));
  scani(n), scani(m), scani(b);
  for (int i = 0; i < n; i++) {
    long long x, y, z;
    scani(x), scani(y), scani(z);
    in[i] = data(x, y, z);
    int mask = 0;
    for (int j = 0; j < z; j++) {
      int a;
      scani(a);
      st.insert(a);
      mask |= (1 << (a - 1));
    }
    in[i].sMask = mask;
  }
  if (st.size() < m) {
    printf("-1\n");
    return 0;
  }
  sort(in, in + n);
  limit = (1 << m) - 1;
  long long ans = 2e18;
  int id = 0;
  for (int i = 0; i <= limit; i++) dp[i] = 2e18;
  for (int i = 0; i < n; i++) {
    dp[in[i].sMask] = min(b * in[i].monitor + in[i].money, dp[in[i].sMask]);
    for (int j = limit; j >= 0; j--)
      dp[j | in[i].sMask] = min(dp[j | in[i].sMask], in[i].money + dp[j]);
    ans = min(ans, dp[limit]);
  }
  if (ans >= 2e18) ans = -1;
  write(ans);
  return 0;
}
