#include <bits/stdc++.h>
using namespace std;
const long long inf = (long long)2e18;
const double eps = 1e-9;
const double pi = acos(-1.0);
int n, m, b;
pair<int, pair<int, int> > a[110];
long long dp[2][1 << 21];
int cur = 0, nxt = 0;
int main() {
  cin >> n >> m >> b;
  for (int i = 0; i < n; i++) {
    int k;
    cin >> a[i].second.first >> a[i].first >> k;
    a[i].second.second = 0;
    while (k--) {
      int x;
      cin >> x;
      a[i].second.second |= (1 << (x - 1));
    }
  }
  sort(a, a + n);
  for (int i = 0; i < (1 << m); i++) dp[0][i] = inf;
  dp[0][0] = 0;
  long long ans = inf;
  for (int iter = 0; iter < n; iter++) {
    nxt = (cur ^ 1);
    for (int i = 0; i < (1 << m); i++) dp[nxt][i] = dp[cur][i];
    int x = a[iter].second.first, k = a[iter].first;
    int mask = a[iter].second.second;
    for (int i = 0; i < (1 << m); i++)
      dp[nxt][i | mask] = min(dp[nxt][i | mask], x + dp[cur][i]);
    ans = min(ans, dp[nxt][(1 << m) - 1] + b * 1ll * k);
    cur ^= 1;
  }
  if (ans == inf) ans = -1;
  cout << ans << endl;
  return 0;
}
