#include <bits/stdc++.h>
using namespace std;
inline long long ra() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
struct node {
  long long c, x, k;
} a[105];
long long n, m, b;
long long f[(1 << 21)], ans = 5000000000000000000LL, sum;
void cal(long long x) {
  for (long long i = 0; i <= sum; i++)
    if (f[i] + a[x].x < f[i | a[x].c]) f[i | a[x].c] = f[i] + a[x].x;
  ans = min(ans, f[sum] + b * a[x].k);
}
bool cmp(node a, node b) { return a.k < b.k; }
int main() {
  n = ra();
  m = ra();
  b = ra();
  for (long long i = 1; i <= n; i++) {
    a[i].x = ra();
    a[i].k = ra();
    long long t = ra();
    for (long long j = 1; j <= t; j++) {
      long long x = ra();
      a[i].c |= 1 << x - 1;
    }
  }
  sum = (1 << m) - 1;
  sort(a + 1, a + n + 1, cmp);
  for (long long i = 0; i <= sum; i++) f[i] = 5000000000000000000LL;
  f[0] = 0;
  for (long long i = 1; i <= n; i++) cal(i);
  if (ans != 5000000000000000000LL)
    cout << ans;
  else
    cout << "-1";
  return 0;
}
