+ محدودیت زمان: ۱ ثانیه + محدودیت حافظه: ۲۵۶ مگابایت ---------- The downtown is very busy this weekend. Javad and Jalal are each organizing a race, namely Javad Rally and Jalal Rally. They have located the start and final intersections for each race and are now negotiating with the local police to finalize the route of each race. The police will close the intersections of each route on the race day, so **there are no shared intersections in the routes**. Moreover, since the race routes are closed by the local police on the race day which makes more traffic congestion in the downtown, each route must be the shortest path from the start to its final intersections. They have trouble figuring out the proper conflict-free routes, so they asked you for help to count the number of different ways to organize the races. Two races are different if the pair of their routes are different. The map of the city is given as $n$ intersections numbered $1$ to $n$, and $m$ roads connecting those intersections. Each road has a specified length. Moreover, for each rally, the start and the final intersections are given. You should calculate the number of the different conflict-free shortest path races. # ورودی The first line of the input contains two integers $n$ ($4 \leq n \leq 24$) and $m$ ($1 \leq m \leq \frac{n(n - 1)}{2}$). The following $m$ lines are the road descriptions. The $i-th$ road has three integers: $u_i$ ($1 \leq u_i \leq n$), $v_i$ ($1 \leq v_i \leq n$), and $w_i$ ($1 \leq w_i \leq 1000$) denoting its two end-vertices and its length. There are no self-loops and multiple edges in the given map and all roads are bidirectional. The last line contains $4$ integer: $s_1$,$t_1$, $s_2$, and $t_2$ ($1 \leq s_1, t_1, s_2, t_2 \leq n$); the numbers of the start and the final intersections of Javad’s route and Jalal’s route, respectively. It is guaranteed that all these numbers are distinct. It is guaranteed that the given map is connected, i.e., there is a path between any two intersections. # خروجی Print the number of different ways to organize both races. # مثال‌ها ## ورودی نمونه ۱ ``` 4 4 1 2 2 2 3 1 1 3 1 3 4 1 1 2 3 4 ```` ## خروجی نمونه ۱ ``` 1 ```` ## ورودی نمونه ۲ ``` 4 3 1 2 1 2 3 1 3 4 1 1 3 2 4 ```` ## خروجی نمونه ۲ ``` 0 ```` ## ورودی نمونه ۳ ``` 6 8 1 4 1 1 3 1 4 2 1 3 2 1 1 2 2 1 5 1 5 2 1 5 6 2 1 2 6 5 ```` ## خروجی نمونه ۳ ``` 3 ````