Problem: SmallR is a biologist. Her latest research finding is how to change the sex of dogs. In other words, she can change female dogs into male dogs and vice versa.

She is going to demonstrate this technique. Now SmallR has n dogs, the costs of each dog's change may be different. The dogs are numbered from 1 to n. The cost of change for dog i is vi RMB. By the way, this technique needs a kind of medicine which can be valid for only one day. So the experiment should be taken in one day and each dog can be changed at most once.

This experiment has aroused extensive attention from all sectors of society. There are m rich folks which are suspicious of this experiment. They all want to bet with SmallR forcibly. If SmallR succeeds, the i-th rich folk will pay SmallR wi RMB. But it's strange that they have a special method to determine whether SmallR succeeds. For i-th rich folk, in advance, he will appoint certain ki dogs and certain one gender. He will think SmallR succeeds if and only if on some day the ki appointed dogs are all of the appointed gender. Otherwise, he will think SmallR fails.

If SmallR can't satisfy some folk that isn't her friend, she need not pay him, but if someone she can't satisfy is her good friend, she must pay g RMB to him as apologies for her fail.

Then, SmallR hope to acquire money as much as possible by this experiment. Please figure out the maximum money SmallR can acquire. By the way, it is possible that she can't obtain any money, even will lose money. Then, please give out the minimum money she should lose.

Input

The first line contains three integers n, m, g (1 ≤ n ≤ 104, 0 ≤ m ≤ 2000, 0 ≤ g ≤ 104). The second line contains n integers, each is 0 or 1, the sex of each dog, 0 represent the female and 1 represent the male. The third line contains n integers v1, v2, ..., vn (0 ≤ vi ≤ 104).

Each of the next m lines describes a rich folk. On the i-th line the first number is the appointed sex of i-th folk (0 or 1), the next two integers are wi and ki (0 ≤ wi ≤ 104, 1 ≤ ki ≤ 10), next ki distinct integers are the indexes of appointed dogs (each index is between 1 and n). The last number of this line represents whether i-th folk is SmallR's good friend (0 — no or 1 — yes).

Output

Print a single integer, the maximum money SmallR can gain. Note that the integer is negative if SmallR will lose money. 

Examples

Input

5 5 9
0 1 1 1 0
1 8 6 2 3
0 7 3 3 2 1 1
1 8 1 5 1
1 0 3 2 1 4 1
0 8 3 4 2 1 0
1 7 2 4 1 1


Output

2


Input

5 5 8
1 0 1 1 1
6 5 4 2 8
0 6 3 2 3 4 0
0 8 3 3 2 4 0
0 0 3 3 4 1 1
0 10 3 4 3 1 1
0 4 3 3 4 1 1


Output

16

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
inline int Readint() {
  int ret = 0;
  int f = 1;
  char ch;
  do {
    ch = getchar();
    if (ch == '-') f *= -1;
  } while (ch >= 0 && (ch < '0' || ch > '9'));
  while ('0' <= ch && ch <= '9') {
    ret = ret * 10 + ch - '0';
    ch = getchar();
  }
  return ret * f;
}
void open() {
  freopen("E.in", "r", stdin);
  freopen("E.out", "w", stdout);
}
void close() {
  fclose(stdin);
  fclose(stdout);
}
const int MAXN = 1e4 + 10;
const int MAXM = 1e7 + 10;
const int inf = 2e9;
int tot = -1;
int sx[MAXN];
int val[MAXN];
int to[MAXM] = {0};
int nxt[MAXM] = {0};
int f[MAXM] = {0};
int hd[MAXN * 2];
int n, m, g;
int src, snk;
int ans = 0;
inline void add(const int &x, const int &y, const int &flow) {
  tot++;
  to[tot] = y;
  nxt[tot] = hd[x];
  f[tot] = flow;
  hd[x] = tot;
}
void init() {
  memset(hd, -1, sizeof(hd));
  n = Readint(), m = Readint(), g = Readint();
  for (int i = 1, _END_ = n; i <= _END_; i++) sx[i] = Readint();
  for (int i = 1, _END_ = n; i <= _END_; i++) val[i] = Readint();
  tot = -1;
  src = 0;
  snk = n + m + 1;
  for (int i = 1, _END_ = n; i <= _END_; i++)
    if (sx[i])
      add(src, i, val[i]), add(i, src, 0);
    else
      add(i, snk, val[i]), add(snk, i, 0);
  int chs, vl, _, yes;
  int node;
  for (int i = 1, _END_ = m; i <= _END_; i++) {
    chs = Readint(), vl = Readint(), _ = Readint();
    ans += vl;
    for (int __ = 1, _END_ = _; __ <= _END_; __++) {
      node = Readint();
      if (chs)
        add(n + i, node, inf), add(node, n + i, 0);
      else
        add(node, n + i, inf), add(n + i, node, 0);
    }
    yes = Readint();
    if (chs)
      add(src, n + i, vl + yes * g), add(n + i, src, 0);
    else
      add(n + i, snk, vl + yes * g), add(snk, n + i, 0);
  }
}
int vis[MAXN * 2];
int dis[MAXN * 2];
const int MAXQ = MAXN * 2 + 10;
int que[MAXQ + 1];
int in[MAXQ];
int SPFA() {
  int l = 0, r = 0;
  int now, j;
  memset(vis, 0, sizeof(vis));
  memset(dis, 0, sizeof(dis));
  que[r++] = src;
  vis[0] = 1;
  while (l != r) {
    now = que[l];
    in[now] = 0;
    if (l == MAXQ)
      l = 0;
    else
      l++;
    for (int i = hd[now]; i != -1; i = nxt[i])
      if (f[i]) {
        j = to[i];
        if (!vis[j]) {
          vis[j] = 1;
          dis[j] = dis[now] + 1;
          in[j] = 1;
          que[r] = j;
          if (r == MAXQ)
            r = 0;
          else
            r++;
        } else if (dis[j] > dis[now] + 1) {
          dis[j] = dis[now] + 1;
          if (!in[j]) {
            in[j] = 1;
            if (r == MAXQ)
              r = 0;
            else
              r++;
          }
        }
      }
  }
  return vis[snk];
}
int dfs(int p, int flow) {
  int ret = 0, tmp;
  if (p == snk) return flow;
  for (int i = hd[p]; i != -1; i = nxt[i])
    if (dis[to[i]] == dis[p] + 1 && f[i]) {
      tmp = dfs(to[i], min(flow - ret, f[i]));
      ret += tmp;
      f[i] -= tmp;
      f[i ^ 1] += tmp;
      if (ret == flow) return ret;
    }
  if (!ret) dis[p] = 0;
  return ret;
}
int maxflow() {
  int ret = 0;
  while (SPFA()) ret += dfs(src, inf);
  return ret;
}
int main() {
  int _ = 0;
  init();
  ans -= maxflow();
  printf("%d\n", ans);
  close();
  return 0;
}