Problem: On the Berland Dependence Day it was decided to organize a great marathon. Berland consists of n cities, some of which are linked by two-way roads. Each road has a certain length. The cities are numbered from 1 to n. It is known that one can get from any city to any other one by the roads.

n runners take part in the competition, one from each city. But Berland runners are talkative by nature and that's why the juries took measures to avoid large crowds of marathon participants. The jury decided that every runner should start the marathon from their hometown. Before the start every sportsman will get a piece of paper containing the name of the city where the sportsman's finishing line is. The finish is chosen randomly for every sportsman but it can't coincide with the sportsman's starting point. Several sportsmen are allowed to finish in one and the same city. All the sportsmen start simultaneously and everyone runs the shortest route from the starting point to the finishing one. All the sportsmen run at one speed which equals to 1.

After the competition a follow-up table of the results will be composed where the sportsmen will be sorted according to the nondecrease of time they spent to cover the distance. The first g sportsmen in the table will get golden medals, the next s sportsmen will get silver medals and the rest will get bronze medals. Besides, if two or more sportsmen spend the same amount of time to cover the distance, they are sorted according to the number of the city where a sportsman started to run in the ascending order. That means no two sportsmen share one and the same place.

According to the rules of the competition the number of gold medals g must satisfy the inequation g1 ≤ g ≤ g2, where g1 and g2 are values formed historically. In a similar way, the number of silver medals s must satisfy the inequation s1 ≤ s ≤ s2, where s1 and s2 are also values formed historically.

At present, before the start of the competition, the destination points of every sportsman are unknown. However, the press demands details and that's why you are given the task of counting the number of the ways to distribute the medals. Two ways to distribute the medals are considered different if at least one sportsman could have received during those distributions different kinds of medals.

Input

The first input line contains given integers n and m (3 ≤ n ≤ 50, n - 1 ≤ m ≤ 1000), where n is the number of Berland towns and m is the number of roads.

Next in m lines road descriptions are given as groups of three integers v, u, c, which are the numbers of linked towns and its length (1 ≤ v, u ≤ n, v ≠ u, 1 ≤ c ≤ 1000). Every pair of cities have no more than one road between them.

The last line contains integers g1, g2, s1, s2 (1 ≤ g1 ≤ g2, 1 ≤ s1 ≤ s2, g2 + s2 < n). The input data numbers, located on one line, are space-separated.

Output

Print the single number — the number of ways to distribute the medals. It is guaranteed that the number fits in the standard 64-bit signed data type.

Examples

Input

3 2
1 2 1
2 3 1
1 1 1 1


Output

3


Input

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


Output

19


Input

3 3
1 2 2
2 3 1
3 1 2
1 1 1 1


Output

4

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 50 + 10;
int n, m, adj[MAXN][MAXN], G1, G2, S1, S2;
pair<int, int> MIN[MAXN], MAX[MAXN];
vector<pair<int, int>> node[MAXN];
bool can[MAXN][MAXN][MAXN];
long long answer, dp[MAXN][MAXN][MAXN];
int main() {
  ios::sync_with_stdio(0);
  memset(adj, 63, sizeof(adj));
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int u, v, w;
    cin >> u >> v >> w;
    u--;
    v--;
    adj[u][v] = adj[v][u] = w;
  }
  cin >> G1 >> G2 >> S1 >> S2;
  for (int k = 0; k < n; k++)
    for (int i = 0; i < n; i++)
      for (int j = 0; j < n; j++)
        adj[i][j] = min(adj[i][j], adj[i][k] + adj[k][j]);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++)
      if (i != j) node[i].push_back(pair<int, int>(adj[i][j], i));
    sort(node[i].begin(), node[i].end());
    MIN[i] = node[i][0];
    MAX[i] = node[i][n - 2];
  }
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++)
      for (int k = 0; k < n; k++) {
        if (i == j || i == k || j == k) continue;
        int l = upper_bound(node[k].begin(), node[k].end(), MIN[i]) -
                node[k].begin();
        int r = lower_bound(node[k].begin(), node[k].end(), MAX[j]) -
                node[k].begin() - 1;
        if (l <= r) can[i][j][k] = true;
      }
  for (int last_min = 0; last_min < n; last_min++)
    for (int first_max = 0; first_max < n; first_max++) {
      if (last_min == first_max || MIN[last_min] >= MAX[first_max]) continue;
      memset(dp, 0, sizeof(dp));
      dp[0][0][0] = 1;
      for (int v = 0; v < n; v++)
        for (int i = 0; i <= (v + 1); i++)
          for (int j = 0; (j + i) <= (v + 1); j++) {
            if (v == last_min) {
              if (i) dp[v + 1][i][j] += dp[v][i - 1][j];
              continue;
            }
            if (v == first_max) {
              if (j) dp[v + 1][i][j] += dp[v][i][j - 1];
              continue;
            }
            if (MIN[v] < MIN[last_min] && i) dp[v + 1][i][j] += dp[v][i - 1][j];
            if (MAX[v] > MAX[first_max] && j)
              dp[v + 1][i][j] += dp[v][i][j - 1];
            if (can[last_min][first_max][v]) dp[v + 1][i][j] += dp[v][i][j];
          }
      for (int g = 0; g <= n; g++)
        for (int b = 0; (g + b) <= n; b++)
          if (G1 <= g && g <= G2 && S1 <= (n - g - b) && (n - g - b) <= S2)
            answer += dp[n][g][b];
    }
  cout << answer << endl;
  return 0;
}