#include <bits/stdc++.h>
using namespace std;
const long long INF = 4e18;
struct node {
  int x, k, s;
} f[105];
long long dp[(1 << 20) + 10];
inline bool cmp(node a, node b) { return a.k < b.k; }
int main() {
  int t, n, m, b, x;
  memset(dp, -1, sizeof(dp));
  scanf("%d%d%d", &n, &m, &b);
  for (int i = 0; i < n; i++) {
    scanf("%d%d", &f[i].x, &f[i].k);
    scanf("%d", &t);
    while (t--) scanf("%d", &x), f[i].s |= 1 << (x - 1);
  }
  sort(f, f + n, cmp);
  int limit = (1 << m) - 1;
  long long ans = INF;
  dp[0] = 0;
  for (int i = 0; i < n; i++) {
    for (int st = 0; st <= limit; st++) {
      if (dp[st] == -1) continue;
      t = st | f[i].s;
      if (dp[t] != -1)
        dp[t] = min(dp[t], dp[st] + f[i].x);
      else
        dp[t] = dp[st] + f[i].x;
    }
    if (dp[limit] != -1) ans = min(ans, dp[limit] + 1LL * f[i].k * b);
  }
  printf("%I64d\n", ans == INF ? -1 : ans);
  return 0;
}
