#include <bits/stdc++.h>
using namespace std;
long long N, M, B;
struct node {
  long long x, k, m, M;
} friends[100];
long long dp[1 << 20];
inline bool comp(const node &a, const node &b) { return a.k < b.k; }
int main() {
  long long tin, cansolve[20] = {0};
  scanf("%I64d %I64d %I64d", &N, &M, &B);
  for (int i = 0; i < N; ++i) {
    scanf("%I64d %I64d %I64d", &friends[i].x, &friends[i].k, &friends[i].m);
    friends[i].M = 0;
    for (int o = 0; o < friends[i].m; ++o) {
      scanf("%I64d", &tin);
      --tin;
      friends[i].M ^= 1 << tin;
      ++cansolve[tin];
    }
  }
  for (int i = 0; i < M; ++i) {
    if (!cansolve[i]) {
      puts("-1");
      return 0;
    }
  }
  sort(friends, friends + N, comp);
  long long full = (1 << M) - 1;
  for (int p = 1; p <= full; ++p) dp[p] = LLONG_MAX;
  dp[0] = 0;
  long long res = LLONG_MAX;
  for (int i = 0; i < N; ++i) {
    for (int p = 0; p <= full; ++p) {
      if (dp[p] != LLONG_MAX)
        dp[p | friends[i].M] = min(dp[p | friends[i].M], dp[p] + friends[i].x);
    }
    if (dp[full] != LLONG_MAX) res = min(res, dp[full] + B * friends[i].k);
  }
  printf("%I64d\n", res);
  return 0;
}
