#include <bits/stdc++.h>
using namespace std;
const double pi = 3.141592653589;
const long long int zero = 0;
long long int mod = 998244353;
const long long int inf = 1e9;
const long long int inff = 9000000000000000000;
char digits[10] = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9'};
char al[26] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm',
               'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
char capital[26] = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I',
                    'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R',
                    'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    long long int n, m, b, a, c;
    cin >> n >> m >> b;
    long long int power[25];
    power[0] = 1;
    for (int i = 1; i < 25; i += 1) {
      power[i] = 2 * power[i - 1];
    }
    long long int x[n], scr[n], prob[n];
    vector<pair<long long int, long long int> > v1;
    for (int i = 0; i < n; i += 1) {
      cin >> x[i] >> scr[i] >> a;
      prob[i] = 0;
      for (int j = 0; j < a; j += 1) {
        cin >> c;
        prob[i] += power[c - 1];
      }
      v1.push_back({scr[i], i});
    }
    sort(v1.begin(), v1.end());
    long long int ans = inff;
    pair<long long int, long long int> dp[power[m]];
    for (int i = 0; i < power[m]; i += 1) {
      dp[i] = {inff, inff};
    }
    dp[0] = {0, 0};
    for (int i = 0; i < n; i += 1) {
      for (int j = 0; j < power[m]; j += 1) {
        if (dp[j].first != inff) {
          a = v1[i].second;
          if (dp[j | prob[a]].first > dp[j].first + x[a]) {
            dp[j | prob[a]].first = dp[j].first + x[a];
            dp[j | prob[a]].second = scr[a];
          }
        }
      }
      if (dp[power[m] - 1].first != inff) {
        ans = min(ans, dp[power[m] - 1].first + dp[power[m] - 1].second * b);
      }
    }
    if (ans == inff) {
      ans = -1;
    }
    cout << ans;
  }
}
