#include <bits/stdc++.h>
using namespace std;
const int MN = 1e2 + 1;
const int MM = 20;
const long long llinf = 1ll << 62;
long long dp[2][1 << MM];
pair<int, pair<int, int> > Friend[MN];
int main() {
  int n, m, b;
  scanf("%d%d%d", &n, &m, &b);
  for (int i = 0; i < n; ++i) {
    int problems_cou;
    scanf("%d%d%d", &Friend[i].second.first, &Friend[i].first, &problems_cou);
    for (int k = 0; k < problems_cou; ++k) {
      int x;
      scanf("%d", &x);
      x--;
      Friend[i].second.second |= (1 << x);
    }
  }
  sort(Friend, Friend + n);
  reverse(Friend, Friend + n);
  for (int i = 0; i <= n; ++i)
    for (int mask = 0; mask < (1 << m); ++mask) dp[i % 2][mask] = llinf;
  dp[0][0] = 0;
  for (int i = 0; i < n; ++i) {
    for (int mask = 0; mask < (1 << m); ++mask)
      dp[(i + 1) % 2][mask] = dp[i % 2][mask];
    for (int mask = 0; mask < (1 << m); ++mask)
      dp[(i + 1) % 2][mask | Friend[i].second.second] =
          min(dp[(i + 1) % 2][mask | Friend[i].second.second],
              dp[i % 2][mask] + Friend[i].second.first +
                  (mask == 0 ? Friend[i].first * (long long)b : 0));
  }
  if (dp[n % 2][(1 << m) - 1] == llinf)
    printf("-1\n");
  else
    printf("%I64d\n", dp[n % 2][(1 << m) - 1]);
}
