#include <bits/stdc++.h>
using namespace std;
struct node {
  long long x, k;
  int sta, m;
  bool operator<(const node &b) const { return k < b.k; }
} a[110];
long long dp[(1 << 20) + 10];
int main() {
  long long fuck, b, ans = -1;
  int n, m, temp, i, j, y;
  scanf("%d%d%I64dd", &n, &m, &b);
  for (i = 1; i <= n; i++) {
    scanf("%I64d%I64d%d", &a[i].x, &a[i].k, &a[i].m);
    temp = 0;
    for (j = 1; j <= a[i].m; j++) {
      scanf("%d", &y);
      temp = temp | (1 << (y - 1));
    }
    a[i].sta = temp;
  }
  sort(a + 1, a + 1 + n);
  memset(dp, -1, sizeof(dp));
  dp[0] = 0;
  int tot = (1 << m);
  for (i = 1; i <= n; i++) {
    for (j = tot - 1; j >= 0; j--) {
      if (dp[j] < 0) continue;
      if (dp[j | a[i].sta] == -1)
        dp[j | a[i].sta] = dp[j] + a[i].x;
      else if (dp[j | a[i].sta] > dp[j] + a[i].x)
        dp[j | a[i].sta] = dp[j] + a[i].x;
    }
    if (dp[tot - 1] < 0) continue;
    fuck = dp[tot - 1] + a[i].k * b;
    if (ans == -1 || fuck < ans) ans = fuck;
  }
  printf("%I64d\n", ans);
  return 0;
}
