#include <bits/stdc++.h>
using namespace std;
template <class T>
T sqr(T x) {
  return x * x;
}
struct sa {
  int x, k, st;
  friend bool operator<(sa a, sa b) { return a.k < b.k; }
};
sa a[300];
long long f[1 << 20];
int n, m, b, p;
long long ans;
int main() {
  int i, j, t, st, x;
  scanf("%d%d%d", &n, &m, &b);
  for (i = 0; i < n; i++) {
    scanf("%d%d%d", &a[i].x, &a[i].k, &t);
    for (j = 0, st = 0; j < t; j++) {
      scanf("%d", &x);
      st |= 1 << (x - 1);
    }
    a[i].st = st;
  }
  sort(a, a + n);
  p = 1 << m;
  ans = 2000000000000000000LL;
  for (j = 0; j < p; j++) f[j] = 2000000000000000000LL;
  f[0] = 0;
  for (i = 0; i < n; i++) {
    for (j = 0; j < p; j++) f[j | a[i].st] = min(f[j | a[i].st], f[j] + a[i].x);
    ans = min(ans, f[p - 1] + (long long)a[i].k * b);
  }
  if (ans == 2000000000000000000LL) {
    puts("-1");
    return 0;
  }
  cout << ans << endl;
}
