#include <bits/stdc++.h>
using namespace std;
const int maxn = 21;
const long long inf = 4e18 + 5;
int n, m;
long long b;
pair<long long, long long> niz[105];
long long dp[(1 << maxn)];
int koje[105];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  cin >> n >> m >> b;
  for (int i = 0; i < n; i++) {
    int len;
    cin >> niz[i].first >> niz[i].second >> len;
    for (int j = 0; j < len; j++) {
      int x;
      cin >> x;
      koje[i] ^= (1 << (x - 1));
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = i + 1; j < n; j++) {
      if (niz[j].second < niz[i].second) {
        swap(niz[i], niz[j]);
        swap(koje[i], koje[j]);
      }
    }
  }
  for (int mask = 0; mask < (1 << m); mask++) dp[mask] = inf;
  long long rez = inf;
  dp[0] = 0;
  for (int i = 0; i < n; i++) {
    for (int mask = 0; mask < (1 << m); mask++)
      dp[mask | koje[i]] = min(dp[mask | koje[i]], dp[mask] + niz[i].first);
    long long kol = dp[(1 << m) - 1] + 1LL * niz[i].second * b;
    rez = min(rez, kol);
  }
  cout << (rez == inf ? -1 : rez) << endl;
  return 0;
}
