Problem: Farmer John is obsessed with making Bessie exercise more!

Bessie is out grazing on the farm, which consists of n fields connected by m directed roads. Each road takes some time w_i to cross. She is currently at field 1 and will return to her home at field n at the end of the day.

Farmer John has plans to increase the time it takes to cross certain roads. He can increase the time it takes to cross each road by a nonnegative amount, but the total increase cannot exceed x_i for the i-th plan. 

Determine the maximum he can make the shortest path from 1 to n for each of the q independent plans.

Input

The first line contains integers n and m (2 ≤ n ≤ 50, 1 ≤ m ≤ n ⋅ (n-1)) — the number of fields and number of roads, respectively.

Each of the following m lines contains 3 integers, u_i, v_i, and w_i (1 ≤ u_i, v_i ≤ n, 1 ≤ w_i ≤ 10^6), meaning there is an road from field u_i to field v_i that takes w_i time to cross.

It is guaranteed that there exists a way to get to field n from field 1. It is guaranteed that the graph does not contain self-loops or parallel edges. It is possible to have a road from u to v and a road from v to u.

The next line contains a single integer q (1 ≤ q ≤ 10^5), the number of plans.

Each of the following q lines contains a single integer x_i, the query (0 ≤ x_i ≤ 10^5).

Output

For each query, output the maximum Farmer John can make the shortest path if the total increase does not exceed x_i.

Your answer is considered correct if its absolute or relative error does not exceed 10^{-6}.

Formally, let your answer be a, and the jury's answer be b. Your answer is accepted if and only if \frac{|a - b|}{max{(1, |b|)}} ≤ 10^{-6}.

Example

Input


3 3
1 2 2
2 3 2
1 3 3
5
0
1
2
3
4


Output


3.0000000000
4.0000000000
4.5000000000
5.0000000000
5.5000000000

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 55;
const int M = N * N;
const int inf = 1e9 + 7;
struct cf {
  int c, f;
};
int tot, s, t, pre[N];
int head[N], edge_id = 1;
struct node {
  int to, val, w, next;
} e[M << 1];
void add_edge(int u, int v, int val, int w) {
  ++edge_id, e[edge_id].next = head[u], e[edge_id].w = w, e[edge_id].val = val,
             e[edge_id].to = v, head[u] = edge_id;
}
void add(int u, int v, int val, int w) {
  add_edge(u, v, val, w), add_edge(v, u, 0, -w);
}
int dis[N];
bool vis[N];
bool SPFA() {
  fill(dis + 1, dis + tot + 1, inf);
  queue<int> q;
  q.push(s), dis[s] = 0;
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    vis[u] = 0;
    for (int i = head[u]; i; i = e[i].next) {
      int v = e[i].to;
      if (e[i].val && dis[v] > dis[u] + e[i].w) {
        dis[v] = dis[u] + e[i].w, pre[v] = i;
        if (!vis[v]) vis[v] = 1, q.push(v);
      }
    }
  }
  return dis[t] < inf;
}
vector<pair<int, int> > ve;
cf dinic() {
  cf res = {};
  while (SPFA()) {
    int flow = inf;
    for (int i = t; i != s; i = e[pre[i] ^ 1].to)
      flow = min(flow, e[pre[i]].val);
    for (int i = t; i != s; i = e[pre[i] ^ 1].to)
      e[pre[i]].val -= flow, e[pre[i] ^ 1].val += flow;
    res.c += flow * dis[t], res.f += flow;
    ve.push_back(make_pair(res.f, res.c));
  }
  return res;
}
int n, m;
int main() {
  scanf("%d%d", &n, &m), tot = n;
  s = 1, t = n;
  for (int i = 1, iE = m; i <= iE; i++) {
    int u, v, w;
    scanf("%d%d%d", &u, &v, &w);
    add(u, v, 1, w);
  }
  dinic();
  int q;
  scanf("%d", &q);
  while (q--) {
    int p;
    scanf("%d", &p);
    double ans = inf;
    for (pair<int, int> x : ve)
      ans = min(ans, (double)(x.second + p) / x.first);
    printf("%.10lf\n", ans);
  }
  return 0;
}