#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:500000000")
using namespace std;
int X[109], K[109], M[109], Mask[109];
long long dp[2][1 << 20];
int main() {
  int n, m, b, i, k, j, a;
  scanf("%d %d %d", &n, &m, &b);
  for (i = 0; i < n; i++) {
    scanf("%d %d %d", &X[i], &K[i], &M[i]);
    for (j = 0; j < M[i]; j++) {
      scanf("%d", &a);
      a--;
      Mask[i] |= 1 << a;
    }
  }
  for (i = 0; i < n; i++) {
    for (j = i + 1; j < n; j++) {
      if (K[i] > K[j]) {
        swap(K[i], K[j]);
        swap(M[i], M[j]);
        swap(X[i], X[j]);
        swap(Mask[i], Mask[j]);
      }
    }
  }
  long long inf = 1ll << 62ll;
  long long res = inf;
  for (i = 0; i < 2; i++)
    for (j = 0; j < (1 << 20); j++) dp[i][j] = inf;
  dp[1][0] = 0;
  int mask;
  for (i = 0; i < n; i++) {
    for (mask = 0; mask < (1 << m); mask++) {
      long long &d = dp[i & 1][mask];
      d = dp[(i + 1) & 1][mask];
      int msk = (mask & Mask[i]) ^ mask;
      d = min(d, dp[(i + 1) & 1][msk] + X[i]);
    }
    res = min(res, dp[i & 1][mask - 1] + K[i] * (long long)b);
  }
  if (res >= inf) res = -1;
  cout << res << endl;
}
