Problem: Kyoya Ootori wants to take the train to get to school. There are n train stations and m one-way train lines going between various stations. Kyoya is currently at train station 1, and the school is at station n. To take a train, he must pay for a ticket, and the train also takes a certain amount of time. However, the trains are not perfect and take random amounts of time to arrive at their destination. If Kyoya arrives at school strictly after t time units, he will have to pay a fine of x.

Each train line is described by a ticket price, and a probability distribution on the time the train takes. More formally, train line i has ticket cost ci, and a probability distribution pi, k which denotes the probability that this train will take k time units for all 1 ≤ k ≤ t. Amounts of time that each of the trains used by Kyouya takes are mutually independent random values (moreover, if Kyoya travels along the same train more than once, it is possible for the train to take different amounts of time and those amounts are also independent one from another). 

Kyoya wants to get to school by spending the least amount of money in expectation (for the ticket price plus possible fine for being late). Of course, Kyoya has an optimal plan for how to get to school, and every time he arrives at a train station, he may recalculate his plan based on how much time he has remaining. What is the expected cost that Kyoya will pay to get to school if he moves optimally?

Input

The first line of input contains four integers n, m, t, x (2 ≤ n ≤ 50, 1 ≤ m ≤ 100, 1 ≤ t ≤ 20 000, 0 ≤ x ≤ 106).

The next 2m lines contain the description of the trains. 

The 2i-th line will have 3 integers ai, bi, ci, representing a one way train from station ai to bi with ticket cost ci (1 ≤ ai, bi ≤ n, ai ≠ bi, 0 ≤ ci ≤ 106). There will always be at least one path from any station to the school. 

The (2i + 1)-th line will contain t integers, pi, 1, pi, 2, ..., pi, t where pi, k / 100000 is the probability that this train will take k units of time to traverse (0 ≤ pi, k ≤ 100 000 for 1 ≤ k ≤ t, <image>). 

It is guaranteed that there is no more than one train between each pair of platforms in each of the directions.

Output

Print a single real number that is equal to an optimal expected cost of getting to school. The answer will be considered correct if its relative or absolute error doesn't exceed 10 - 6.

Examples

Input

4 4 5 1
1 2 0
50000 0 50000 0 0
2 3 0
10000 0 0 0 90000
3 4 0
100000 0 0 0 0
2 4 0
0 0 0 50000 50000


Output

0.7000000000


Input

4 4 5 1
1 2 100
50000 0 50000 0 0
2 3 100
10000 0 0 0 90000
3 4 100
100000 0 0 0 0
2 4 100
0 0 0 50000 50000


Output

200.7500000000

Note

The optimal strategy in the first case is as follows:

First, travel along first train line. With probability 1 / 2 Kyoya will take 1 time unit. Otherwise, Kyoya will take 3 time units.

If the train takes 1 time unit, travel along the 4th train line. Kyoya will make it to school in time with probability 1 / 2. Otherwise, if the train takes 3 time units, travel along the 2nd train line. Kyoya will make it to school in time with probability 1 / 10.

Since the cost of all train lines are zero, we can just look at the probability that Kyoya will incur the penalty. The probability that Kyoya will have to pay the penalty is 1 / 2 × 1 / 2 + 1 / 2 × 9 / 10 = 7 / 10. We can show that no other strategy is strictly better.

The optimal strategy in the second case is to travel along 1 → 2 → 4 no matter what. Kyoya will incur the penalty with probability 3 / 4, and the cost of the trains is 200, thus the expected cost is 200.75.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void init(T &x) {
  x = 0;
  char ch = getchar();
  bool t = 0;
  for (; ch > '9' || ch < '0'; ch = getchar())
    if (ch == '-') t = 1;
  for (; ch >= '0' && ch <= '9'; ch = getchar())
    x = (x << 1) + (x << 3) + (ch - 48);
  if (t) x = -x;
  return;
}
const double PI = acos(-1);
const int N = 1e5 + 10;
const int T = 2e4 + 10;
const int MAXN = 2e5 + 10;
const double INF = 1e18;
struct Complex {
  double x, y;
  Complex(double _x = 0.0, double _y = 0.0) { x = _x, y = _y; }
  inline Complex operator+(const Complex B) {
    return Complex(x + B.x, y + B.y);
  }
  inline Complex operator-(const Complex B) {
    return Complex(x - B.x, y - B.y);
  }
  inline Complex operator*(const Complex B) {
    return Complex(x * B.x - y * B.y, x * B.y + y * B.x);
  }
} w[MAXN], A[MAXN], B[MAXN];
const int M = 220;
int n, m, rader[MAXN];
struct edge {
  int to, next;
} a[M];
int head[M], cnt = 0;
double t[110][T << 1], cost[110];
inline void add(int x, int y) {
  a[++cnt] = (edge){y, head[x]};
  head[x] = cnt;
}
priority_queue<pair<int, int> > Q;
bool vis[M];
int dis[M];
double ans = 0;
int tim, x, R;
double f[51][T << 1], g[M][T << 1];
inline void Dij() {
  Q.push(pair<int, int>(0, n));
  for (int i = 1; i < n; ++i) dis[i] = 1e9;
  dis[n] = 0;
  while (!Q.empty()) {
    pair<int, int> S = Q.top();
    Q.pop();
    int u = S.second, len = -S.first;
    if (vis[u] || dis[u] != len) continue;
    vis[u] = 1;
    for (int v, i = head[u]; i; i = a[i].next) {
      v = a[i].to;
      if (dis[v] > dis[u] + cost[i])
        dis[v] = dis[u] + cost[i], Q.push(pair<int, int>(-dis[v], v));
    }
  }
  return;
}
inline void FFT(Complex *A, int n, int f) {
  for (int i = 0; i < n; ++i)
    if (rader[i] > i) swap(A[i], A[rader[i]]);
  for (int i = 1; i < n; i <<= 1) {
    for (int p = i << 1, j = 0; j < n; j += p) {
      for (int k = 0; k < i; ++k) {
        Complex W = w[n / i * k];
        if (f == -1) W.y = -W.y;
        Complex X = A[j | k], Y = W * A[j | k | i];
        A[j | k] = X + Y, A[j | k | i] = X - Y;
      }
    }
  }
  if (f == -1)
    for (int i = 0; i < n; ++i) A[i].x /= (double)n;
  return;
}
inline int prework(int m) {
  int len = 1, up = -1;
  for (; len <= m; ++up, len <<= 1)
    ;
  for (int i = 0; i < len; ++i) {
    rader[i] = (rader[i >> 1] >> 1) | ((i & 1) << up);
    w[i] = Complex(cos(PI / len * i), sin(PI / len * i));
  }
  return len;
}
inline void Solve(int l, int r) {
  if (l > tim) return;
  if (l == r) {
    for (int u = 1; u <= n; ++u) {
      for (int v, i = head[u]; i; i = a[i].next) {
        v = a[i].to;
        f[v][l] = min(f[v][l], g[i][l] + cost[i]);
      }
    }
    return;
  }
  int mid = l + r >> 1;
  Solve(mid + 1, r);
  int len = prework((r - l) << 1);
  for (int u = 1; u <= n; ++u) {
    for (int v, i = head[u]; i; i = a[i].next) {
      v = a[i].to;
      for (int j = 0; j < len; ++j) A[j] = Complex(), B[j] = Complex();
      int a0 = 0, b0 = 0;
      for (int j = mid + 1; j <= r; ++j) A[a0++] = Complex(f[u][j], 0);
      for (int j = l; j < r; ++j) B[b0++] = Complex(t[i][r - j], 0);
      FFT(A, len, 1), FFT(B, len, 1);
      for (int j = 0; j < len; ++j) A[j] = A[j] * B[j];
      FFT(A, len, -1);
      for (int j = l; j <= mid; ++j) g[i][j] += A[j - mid + r - l - 1].x;
    }
  }
  Solve(l, mid);
}
int main() {
  init(n), init(m), init(tim), init(x);
  int u, v, c;
  for (int i = 1; i <= m; ++i) {
    init(u), init(v), init(c);
    add(v, u);
    for (int j = 1; j <= tim; ++j) {
      int x;
      init(x);
      t[cnt][j] = (double)(x) / 1e5;
    }
    cost[cnt] = c;
  }
  Dij();
  R = tim << 1;
  for (int i = 1; i < n; ++i) {
    for (int j = 0; j <= tim; ++j) f[i][j] = INF;
    for (int j = tim + 1; j <= R; ++j) f[i][j] = dis[i] + x;
  }
  for (int j = tim + 1; j <= R; ++j) f[n][j] = x;
  Solve(0, R);
  printf("%.10lf\n", f[1][0]);
}