#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline bool upmin(T &x, T y) {
  return y < x ? x = y, 1 : 0;
}
template <typename T>
inline bool upmax(T &x, T y) {
  return x < y ? x = y, 1 : 0;
}
const long double eps = 1e-11;
const long double pi = acos(-1);
const long long oo = 1 << 30;
const long long loo = 1ll << 62;
const long long mods1 = 1e9 + 9;
const long long mods2 = 1e9 + 7;
const long long MAXN = 200005;
const long long INF = 0x3f3f3f3f;
inline long long read() {
  long long f = 1, x = 0;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = (x << 3) + (x << 1) + (c ^ 48);
    c = getchar();
  }
  return x * f;
}
long long f[1 << 20];
struct anode {
  long long x, k, s;
} a[205];
signed main() {
  long long n = read(), m = read(), b = read();
  for (long long i = 1; i <= n; i++) {
    a[i].x = read(), a[i].k = read();
    long long x = read(), y;
    while (x--) y = read() - 1, a[i].s |= 1 << y;
  }
  sort(a + 1, a + n + 1, [&](anode x, anode y) { return x.k < y.k; });
  long long ans = loo;
  for (long long i = 1; i < 1 << m; i++) f[i] = loo;
  for (long long i = 1; i <= n; i++) {
    for (long long j = 0; j < 1 << m; j++) upmin(f[j | a[i].s], f[j] + a[i].x);
    upmin(ans, f[(1 << m) - 1] + a[i].k * b);
  }
  if (ans == loo)
    puts("-1");
  else
    printf("%lld\n", ans);
  return 0;
}
