#include <bits/stdc++.h>
using namespace std;
constexpr long long INF = 4e18;
constexpr int M = 2e6;
constexpr int N = 110;
long long n, m, cost, ans = 4e18, cnt, dp[M], num, c, mx;
pair<long long, pair<long long, long long>> p[N];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m >> cost;
  for (int i = 1; i <= n; i++) {
    cin >> p[i].second.first >> p[i].first >> cnt;
    num = 0;
    for (int j = 0; j < cnt; j++) {
      cin >> c;
      num += pow(2, c - 1);
    }
    p[i].second.second = num;
  }
  sort(p + 1, p + n + 1);
  mx = pow(2, m);
  for (int i = 0; i < M; i++) dp[i] = INF;
  dp[0] = 0;
  for (int i = 1; i <= n; i++) {
    num = ~p[i].second.second;
    for (int j = 1; j < mx; j++)
      dp[j] = min(dp[j], dp[num & j] + p[i].second.first);
    ans = min(ans, p[i].first * cost + dp[mx - 1]);
  }
  if (ans == 4e18)
    cout << -1 << '\n';
  else
    cout << ans << '\n';
  return 0;
}
