Problem: Ralph is going to collect mushrooms in the Mushroom Forest. 

There are m directed paths connecting n trees in the Mushroom Forest. On each path grow some mushrooms. When Ralph passes a path, he collects all the mushrooms on the path. The Mushroom Forest has a magical fertile ground where mushrooms grow at a fantastic speed. New mushrooms regrow as soon as Ralph finishes mushroom collection on a path. More specifically, after Ralph passes a path the i-th time, there regrow i mushrooms less than there was before this pass. That is, if there is initially x mushrooms on a path, then Ralph will collect x mushrooms for the first time, x - 1 mushrooms the second time, x - 1 - 2 mushrooms the third time, and so on. However, the number of mushrooms can never be less than 0.

For example, let there be 9 mushrooms on a path initially. The number of mushrooms that can be collected from the path is 9, 8, 6 and 3 when Ralph passes by from first to fourth time. From the fifth time and later Ralph can't collect any mushrooms from the path (but still can pass it).

Ralph decided to start from the tree s. How many mushrooms can he collect using only described paths?

Input

The first line contains two integers n and m (1 ≤ n ≤ 106, 0 ≤ m ≤ 106), representing the number of trees and the number of directed paths in the Mushroom Forest, respectively.

Each of the following m lines contains three integers x, y and w (1 ≤ x, y ≤ n, 0 ≤ w ≤ 108), denoting a path that leads from tree x to tree y with w mushrooms initially. There can be paths that lead from a tree to itself, and multiple paths between the same pair of trees.

The last line contains a single integer s (1 ≤ s ≤ n) — the starting position of Ralph. 

Output

Print an integer denoting the maximum number of the mushrooms Ralph can collect during his route. 

Examples

Input

2 2
1 2 4
2 1 4
1


Output

16

Input

3 3
1 2 4
2 3 3
1 3 8
1


Output

8

Note

In the first sample Ralph can pass three times on the circle and collect 4 + 4 + 3 + 3 + 1 + 1 = 16 mushrooms. After that there will be no mushrooms for Ralph to collect.

In the second sample, Ralph can go to tree 3 and collect 8 mushrooms on the path from tree 1 to tree 3.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int n, m, s, u, v;
int pre;
int dfsNum, blkNum, top, dfn[1000010], sta[1000010], low[1000010],
    belong[1000010];
int degree[1000010];
long long w, iniWeight[1000010], dp[1000010], blkWeight[1000010], pret[1000010];
bool vis[1000010];
typedef struct graph {
  int from, to, next;
  long long weight;
  graph(){};
  graph(int from, int to, int next, long long weight)
      : from(from), to(to), next(next), weight(weight){};
} Edge;
class Graph {
 public:
  int tot, head[1000010];
  Edge edge[1000010 << 1];
  void init() {
    tot = 0;
    memset(head, -1, sizeof(head));
  }
  void add(int from, int to, long long weight) {
    edge[tot] = graph(from, to, head[from], weight);
    head[from] = tot++;
  }
};
Graph mygraph;
vector<pair<int, long long> > reEdge[1000010];
queue<int> que;
void pretreatment() {
  pret[1] = 1;
  pre = 1;
  for (int i = 2; i <= 14200; ++i) {
    pre = pre + i;
    pret[i] = pret[i - 1] + pre;
  }
}
void tarjan(int pos) {
  low[pos] = dfn[pos] = ++dfsNum;
  vis[sta[++top] = pos] = true;
  for (int i = mygraph.head[pos]; i != -1; i = mygraph.edge[i].next) {
    int next = mygraph.edge[i].to;
    if (!dfn[next]) {
      tarjan(next);
      low[pos] = min(low[pos], low[next]);
    } else if (vis[next]) {
      low[pos] = min(low[pos], dfn[next]);
    }
  }
  if (low[pos] == dfn[pos]) {
    int id = ++blkNum;
    belong[pos] = id;
    vis[pos] = false;
    while (sta[top] != pos) {
      belong[sta[top]] = id;
      vis[sta[top--]] = false;
    }
    top--;
  }
}
void shrink() {
  for (int point = 1; point <= n; ++point)
    if (!dfn[point]) tarjan(point);
  for (int ed = 0; ed < mygraph.tot; ed++) {
    u = mygraph.edge[ed].from;
    v = mygraph.edge[ed].to;
    if (belong[u] == belong[v])
      blkWeight[belong[u]] += mygraph.edge[ed].weight;
    else {
      reEdge[belong[v]].push_back({belong[u], iniWeight[ed]});
      degree[belong[u]]++;
    }
  }
  for (int i = 1; i <= blkNum; ++i) {
    if (!degree[i]) que.push(i);
  }
}
void solve() {
  while (que.size()) {
    u = que.front();
    que.pop();
    dp[u] += blkWeight[u];
    for (auto ed : reEdge[u]) {
      v = ed.first;
      degree[v]--;
      dp[v] = max(dp[v], dp[u] + ed.second);
      if (!degree[v]) que.push(v);
    }
  }
}
int main() {
  pretreatment();
  scanf("%d%d", &n, &m);
  mygraph.init();
  for (int i = 0; i < m; ++i) {
    scanf("%d%d%lld", &u, &v, &w);
    iniWeight[i] = w;
    int id = floor(0.5 * sqrt(8 * w + 1.0) - 0.5);
    w = (id + 1) * w - pret[id];
    mygraph.add(u, v, w);
  }
  shrink();
  solve();
  scanf("%d", &s);
  printf("%lld\n", dp[belong[s]]);
  return 0;
}