#include <bits/stdc++.h>
using namespace std;
unsigned long long dp[(1 << 20) + 5];
vector<pair<pair<int, int>, vector<int> > > v;
int val[105];
long long inf = 1.5e18;
int main() {
  int n, m, b;
  scanf("%d %d %d", &n, &m, &b);
  for (int i = 1; i <= n; i++) {
    int x, k, m;
    scanf("%d %d %d", &x, &k, &m);
    vector<int> v1;
    for (int j = 0; j < m; j++) {
      int tmp;
      scanf("%d", &tmp);
      v1.push_back(tmp);
    }
    v.push_back(make_pair(make_pair(k, x), v1));
  }
  for (int i = 0; i <= (1 << m); i++) {
    dp[i] = inf;
  }
  sort(v.begin(), v.end());
  reverse(v.begin(), v.end());
  dp[0] = 0;
  for (int i = 0; i < v.size(); i++) {
    int vl = 0;
    vector<int> v1 = v[i].second;
    for (int j = 0; j < v1.size(); j++) {
      vl += (1 << (v1[j] - 1));
    }
    val[i] = vl;
  }
  for (int i = 0; i < v.size(); i++) {
    int cost = v[i].first.second;
    int req = v[i].first.first;
    for (int mask = 0; mask < (1 << m); mask++) {
      if (mask == 0) {
        dp[val[i]] = min(dp[val[i]], (unsigned long long)req * b + cost);
      } else {
        dp[val[i] | mask] = min(dp[val[i] | mask], dp[mask] + cost);
      }
    }
  }
  if (dp[(1 << m) - 1] != inf)
    cout << dp[(1 << m) - 1];
  else
    printf("-1");
}
