#include <bits/stdc++.h>
using namespace std;
struct Friend {
  int x, k, m;
} friends[110];
long long dp[3][1048600], R[3][1048600];
bool cmp(Friend a, Friend b) { return a.k < b.k; }
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, m, b;
  cin >> n >> m >> b;
  for (int i = 1; i <= n; i++) {
    int inm;
    cin >> friends[i].x >> friends[i].k >> inm;
    bool pro[30];
    memset(pro, 0, sizeof(pro));
    for (int j = 0; j < inm; j++) {
      int in;
      cin >> in;
      pro[in] = 1;
    }
    friends[i].m = 0;
    for (int j = 1; j <= 20; j++) {
      friends[i].m <<= 1;
      friends[i].m += pro[j];
    }
  }
  sort(friends + 1, friends + n + 1, cmp);
  memset(dp, -1, sizeof(dp));
  long long ans = 9223372036854775807, amask = 0;
  for (int i = 1; i <= 20; i++) {
    amask <<= 1;
    if (i <= m) amask += 1;
  }
  dp[0][0] = dp[1][0] = dp[2][0] = 0;
  R[0][0] = R[2][0] = 0;
  R[1][0] = 1;
  for (int i = 1; i <= n; i++) {
    long long fm = friends[i].m, fx = friends[i].x, dpi = i & 1, dpi1 = dpi ^ 1;
    for (int j = 0; j < 1048576; j++) {
      int jofm = j | fm;
      if (R[dpi1][j] < i - 1 && j > 0) {
        R[dpi1][j] = i - 1;
        dp[dpi1][j] = -1;
      }
      if (R[dpi][j] < i && j > 0) {
        R[dpi][j] = i;
        dp[dpi][j] = -1;
      }
      if (R[dpi][jofm] < i && jofm > 0) {
        R[dpi][jofm] = i;
        dp[dpi][jofm] = -1;
      }
      if (dp[dpi1][j] == -1) continue;
      if (dp[dpi][j] == -1)
        dp[dpi][j] = dp[dpi1][j];
      else
        dp[dpi][j] = min(dp[dpi][j], dp[dpi1][j]);
      if (dp[dpi][jofm] == -1)
        dp[dpi][jofm] = dp[dpi1][j] + fx;
      else
        dp[dpi][jofm] = min(dp[dpi1][j] + fx, dp[dpi][jofm]);
    }
    if (dp[dpi][amask] == -1) continue;
    ans = min(ans, dp[dpi][amask] + (long long)b * (long long)friends[i].k);
  }
  if (ans == 9223372036854775807) {
    cout << -1 << '\n';
    return 0;
  }
  cout << ans << '\n';
  return 0;
}
