# Team Rocket Rises Again

It’s the turn of the year, so Bash wants to send presents to his friends. There are n cities in the Himalayan region and they are connected by m bidirectional roads. Bash is living in city s. Bash has exactly one friend in each of the other cities. Since Bash wants to surprise his friends, he decides to send a Pikachu to each of them. Since there may be some cities which are not reachable from Bash’s city, he only sends a Pikachu to those friends who live in a city reachable from his own city. He also wants to send it to them as soon as possible.

He finds out the minimum time for each of his Pikachus to reach its destination city. Since he is a perfectionist, he informs all his friends with the time their gift will reach them. A Pikachu travels at a speed of 1 meters per second. His friends were excited to hear this and would be unhappy if their presents got delayed. Unfortunately Team Rocket is on the loose and they came to know of Bash’s plan. They want to maximize the number of friends who are unhappy with Bash.

They do this by destroying exactly one of the other n - 1 cities. This implies that the friend residing in that city dies, so he is unhappy as well.

Note that if a city is destroyed, all the roads directly connected to the city are also destroyed and the Pikachu may be forced to take a longer alternate route.

Please also note that only friends that are waiting for a gift count as unhappy, even if they die.

Since Bash is already a legend, can you help Team Rocket this time and find out the maximum number of Bash’s friends who can be made unhappy by destroying exactly one city.

Input

The first line contains three space separated integers nm and s (2 ≤ n ≤ 2·105, 1 ≤ s ≤ n) — the number of cities and the number of roads in the Himalayan region and the city Bash lives in.

Each of the next m lines contain three space-separated integers uv and w (1 ≤ u, v ≤ nu ≠ v, 1 ≤ w ≤ 109) denoting that there exists a road between city u and city v of length w meters.

It is guaranteed that no road connects a city to itself and there are no two roads that connect the same pair of cities.

Output

Print a single integer, the answer to the problem.

Examples

input

4 4 31 2 12 3 12 4 13 1 1

output

2

input

7 11 21 2 51 3 52 4 22 5 23 6 33 7 34 6 23 4 26 7 34 5 74 7 7

output

4

Note

In the first sample, on destroying the city 2, the length of shortest distance between pairs of cities (3, 2) and (3, 4) will change. Hence the answer is 2.

Solution:

#include <bits/stdc++.h>

using namespace std;

template <typename T>
class graph {
public:
struct edge {
int from;
int to;
T cost;
};

vector<edge> edges;
vector< vector<int> > g;
int n;

function<bool(int)> ignore;

graph(int _n) : n(_n) {
g.resize(n);
ignore = nullptr;
}

virtual int add(int from, int to, T cost) = 0;

virtual void set_ignore_edge_rule(const function<bool(int)> &f) {
ignore = f;
}

virtual void unset_ignore_edge_rule() {
ignore = nullptr;
}
};

template <typename T>
class digraph : public graph<T> {
public:
using graph<T>::edges;
using graph<T>::g;
using graph<T>::n;
using graph<T>::ignore;

digraph(int _n) : graph<T>(_n) {
}

int add(int from, int to, T cost = 1) {
assert(0 <= from && from < n && 0 <= to && to < n);
int id = (int) edges.size();
g[from].push_back(id);
edges.push_back({from, to, cost});
return id;
}

digraph<T> reverse() {
digraph<T> rev(n);
for (auto &e : edges) {
}
if (ignore != nullptr) {
rev.set_ignore_edge_rule([&](int id) {
return ignore(id);
});
}
return rev;
}
};

template <typename T>
class undigraph : public graph<T> {
public:
using graph<T>::edges;
using graph<T>::g;
using graph<T>::n;

undigraph(int _n) : graph<T>(_n) {
}

int add(int from, int to, T cost = 1) {
assert(0 <= from && from < n && 0 <= to && to < n);
int id = (int) edges.size();
g[from].push_back(id);
g[to].push_back(id);
edges.push_back({from, to, cost});
return id;
}
};

template <typename T>
vector <T> dijkstra(const graph<T> &g, int start) {
assert(0 <= start && start < g.n);
vector<T> dist(g.n, numeric_limits<T>::max());
priority_queue<pair<T, int>, vector<pair<T, int> >, greater<pair<T, int> > > s;
dist[start] = 0;
s.emplace(dist[start], start);
while (!s.empty()) {
T expected = s.top().first;
int i = s.top().second;
s.pop();
if (dist[i] != expected) {
continue;
}
for (int id : g.g[i]) {
if (g.ignore != nullptr && g.ignore(id)) {
continue;
}
auto &e = g.edges[id];
int to = e.from ^ e.to ^ i;
if (dist[i] + e.cost < dist[to]) {
dist[to] = dist[i] + e.cost;
s.emplace(dist[to], to);
}
}
}
return dist;
// returns numeric_limits<T>::max() if there's no path
}

template <typename T>
vector<int> dominators(digraph<T> &g, int root) {
int n = g.n;
vector<int> pos(n, -1);
vector<int> order;
vector<int> parent(n, -1);
function<void(int)> dfs = [&](int v) {
pos[v] = (int) order.size();
order.push_back(v);
for (int id : g.g[v]) {
if (g.ignore != nullptr && g.ignore(id)) {
continue;
}
auto &e = g.edges[id];
int u = e.to;
if (pos[u] == -1) {
parent[u] = v;
dfs(u);
}
}
};
dfs(root);
vector<int> p(n), best(n);
iota(p.begin(), p.end(), 0);
iota(best.begin(), best.end(), 0);
vector<int> sdom = pos;
function<int(int)> find_best = [&](int x) {
if (p[x] != x) {
int u = find_best(p[x]);
if (sdom[u] < sdom[best[x]]) {
best[x] = u;
}
p[x] = p[p[x]];
}
if (sdom[best[p[x]]] < sdom[best[x]]) {
best[x] = best[p[x]];
}
return best[x];
};
digraph<int> g_rev = g.reverse();
vector<int> idom(n, -1);
vector< vector<int> > bucket(n);
for (int it = (int) order.size() - 1; it >= 0; it--) {
int w = order[it];
for (int id : g_rev.g[w]) {
if (g_rev.ignore != nullptr && g_rev.ignore(id)) {
continue;
}
auto &e = g_rev.edges[id];
int u = e.to;
sdom[w] = min(sdom[w], sdom[find_best(u)]);
}
idom[w] = order[sdom[w]];
for (int u : bucket[w]) {
}
for (int id : g.g[w]) {
if (g.ignore != nullptr && g.ignore(id)) {
continue;
}
auto &e = g.edges[id];
int u = e.to;
if (parent[u] == w) {
p[u] = w;
}
}
bucket[order[sdom[w]]].push_back(w);
}
for (int it = 1; it < (int) order.size(); it++) {
int w = order[it];
}
return idom;
// idom[i] -- immediate dominator for vertex i
}

template <typename T>
vector<int> find_topsort(const digraph<T> &g) {
vector<int> deg(g.n, 0);
for (int id = 0; id < (int) g.edges.size(); id++) {
if (g.ignore != nullptr && g.ignore(id)) {
continue;
}
deg[g.edges[id].to]++;
}
vector<int> x;
for (int i = 0; i < g.n; i++) {
if (deg[i] == 0) {
x.push_back(i);
}
}
for (int ptr = 0; ptr < (int) x.size(); ptr++) {
int i = x[ptr];
for (int id : g.g[i]) {
if (g.ignore != nullptr && g.ignore(id)) {
continue;
}
auto &e = g.edges[id];
int to = e.to;
if (--deg[to] == 0) {
x.push_back(to);
}
}
}
if ((int) x.size() != g.n) {
return vector<int>();
}
return x;
}

int main() {
int n, m, st;
scanf("%d %d %d", &n, &m, &st);
st--;
undigraph<long long> gd(n);
for (int i = 0; i < m; i++) {
int x, y, z;
scanf("%d %d %d", &x, &y, &z);
x--; y--;
}
vector<long long> d = dijkstra(gd, st);
digraph<int> g(n);
const long long inf = numeric_limits<long long>::max();
for (int i = 0; i < n; i++) {
for (int id : gd.g[i]) {
auto &e = gd.edges[id];
int to = i ^ e.from ^ e.to;
if (d[to] != inf && d[i] != inf && d[i] + e.cost == d[to]) {
}
}
}
vector<int> dom = dominators(g, st);
vector<int> order = find_topsort(g);
vector<int> who(n), dcnt(n);
for (int i : order) {
if (i == st || dom[i] == -1) {
continue;
}
if (dom[i] == st) {
who[i] = i;
} else {
who[i] = who[dom[i]];
}
dcnt[who[i]]++;
}
int mx = 0;
for (int x : dcnt) {
mx = max(mx, x);
}
printf("%d\n", mx);
return 0;
}