Problem: Malek is a rich man. He also is very generous. That's why he decided to split his money between poor people. A charity institute knows n poor people numbered from 1 to n. The institute gave Malek q recommendations. A recommendation is a segment of people like [l, r] which means the institute recommended that Malek gives one dollar to every person whose number is in this segment.

However this charity has very odd rules about the recommendations. Because of those rules the recommendations are given in such a way that for every two recommendation [a, b] and [c, d] one of the following conditions holds: 

  * The two segments are completely disjoint. More formally either a ≤ b < c ≤ d or c ≤ d < a ≤ b
  * One of the two segments are inside another. More formally either a ≤ c ≤ d ≤ b or c ≤ a ≤ b ≤ d. 



The goodness of a charity is the value of maximum money a person has after Malek finishes giving his money. The institute knows for each recommendation what is the probability that Malek will accept it. They want to know the expected value of goodness of this charity. So they asked you for help.

You have been given the list of recommendations and for each recommendation the probability of it being accepted by Malek. You have also been given how much money each person initially has. You must find the expected value of goodness.

Input

In the first line two space-separated integers n, q (1 ≤ n ≤ 105, 1 ≤ q ≤ 5000) are given.

In the second line n space-separated integers a1, a2, ..., an (0 ≤ ai ≤ 109) are given meaning that person number i initially has ai dollars. 

Each of the next q lines contains three space-separated numbers li, ri, pi (1 ≤ li ≤ ri ≤ n, 0 ≤ p ≤ 1) where li and ri are two integers describing the segment of recommendation and pi is a real number given with exactly three digits after decimal point which is equal to probability of Malek accepting this recommendation.

Note that a segment may appear several times in recommendations.

Output

Output the sought value. Your answer will be considered correct if its absolute or relative error is less than 10 - 6.

Examples

Input

5 2
1 7 2 4 3
1 3 0.500
2 2 0.500


Output

8.000000000


Input

5 2
281 280 279 278 282
1 4 1.000
1 4 0.000


Output

282.000000000


Input

3 5
1 2 3
1 3 0.500
2 2 0.250
1 2 0.800
1 1 0.120
2 2 0.900


Output

4.465000000

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
int ar[100005];
int l[5005], r[5005];
double p[5005];
vector<int> adj[5005];
vector<pair<int, double> > ds[5005];
set<int> rem;
void push(vector<pair<int, double> > tmp[], int node) {
  ds[node].clear();
  int p[2] = {0, 0};
  while (p[0] < tmp[0].size() && p[1] < tmp[1].size()) {
    if (tmp[0][p[0]].first <= tmp[1][p[1]].first) {
      if (ds[node].size() > 0 && ds[node].back().first == tmp[0][p[0]].first) {
        ds[node].back().second += tmp[0][p[0]++].second;
      } else {
        ds[node].push_back(tmp[0][p[0]++]);
      }
    } else {
      if (ds[node].size() > 0 && ds[node].back().first == tmp[1][p[1]].first) {
        ds[node].back().second += tmp[1][p[1]++].second;
      } else {
        ds[node].push_back(tmp[1][p[1]++]);
      }
    }
  }
  while (p[0] < tmp[0].size()) {
    if (ds[node].size() > 0 && ds[node].back().first == tmp[0][p[0]].first) {
      ds[node].back().second += tmp[0][p[0]++].second;
    } else {
      ds[node].push_back(tmp[0][p[0]++]);
    }
  }
  while (p[1] < tmp[1].size()) {
    if (ds[node].size() > 0 && ds[node].back().first == tmp[1][p[1]].first) {
      ds[node].back().second += tmp[1][p[1]++].second;
    } else {
      ds[node].push_back(tmp[1][p[1]++]);
    }
  }
}
bool vis[5005];
const double eps = 1e-13;
void dfs(int node) {
  assert(!vis[node]);
  vis[node] = true;
  for (int ch : adj[node]) {
    dfs(ch);
  }
  int maxValue = 0;
  while (true) {
    set<int>::iterator it = rem.lower_bound(l[node]);
    if (it == rem.end() || *it > r[node]) {
      break;
    }
    maxValue = max(maxValue, ar[*it]);
    rem.erase(it);
  }
  vector<pair<int, double> > tmp[2];
  ds[node].push_back({maxValue, 1.0});
  for (int ch : adj[node]) {
    tmp[0].clear(), tmp[1].clear();
    double sum = 0;
    int pos = 0;
    for (int i = 0; i < ds[ch].size(); ++i) {
      while (pos < ds[node].size()) {
        if (ds[node][pos].first < ds[ch][i].first) {
          sum += ds[node][pos].second;
          ++pos;
        } else {
          break;
        }
      }
      if (ds[ch][i].second * sum > eps)
        tmp[0].push_back({ds[ch][i].first, ds[ch][i].second * sum});
    }
    sum = 0;
    pos = 0;
    for (int i = 0; i < ds[node].size(); ++i) {
      while (pos < ds[ch].size()) {
        if (ds[ch][pos].first <= ds[node][i].first) {
          sum += ds[ch][pos].second;
          ++pos;
        } else {
          break;
        }
      }
      if (ds[node][i].second * sum)
        tmp[1].push_back({ds[node][i].first, ds[node][i].second * sum});
    }
    ds[ch].clear();
    push(tmp, node);
  }
  tmp[0].clear();
  tmp[1].clear();
  for (int i = 0; i < ds[node].size(); ++i) {
    if (ds[node][i].second * p[node] > eps)
      tmp[0].push_back({ds[node][i].first + 1, ds[node][i].second * p[node]});
    if (ds[node][i].second * (1.0 - p[node]) > eps)
      tmp[1].push_back(
          {ds[node][i].first, ds[node][i].second * (1.0 - p[node])});
  }
  push(tmp, node);
}
int myParent[5005];
bool isAnc(int x, int y) {
  if (l[x] == l[y] && r[y] == r[x]) {
    if (y < x) {
      return true;
    } else {
      return false;
    }
  }
  if (l[y] <= l[x] && r[x] <= r[y]) {
    return true;
  }
  return false;
}
void solve() {
  int n, q;
  scanf("%d %d", &n, &q);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &ar[i]);
  }
  for (int i = 0; i <= q; ++i) {
    myParent[i] = -1;
  }
  for (int i = 1; i <= n; ++i) {
    rem.insert(i);
  }
  l[0] = 1, r[0] = n, p[0] = 0.0;
  for (int i = 1; i <= q; ++i) {
    scanf("%d %d %lf", &l[i], &r[i], &p[i]);
  }
  for (int i = 0; i <= q; ++i) {
    for (int j = 0; j <= q; ++j) {
      if (i != j) {
        if (isAnc(j, i) == 1) {
          if (myParent[j] == -1) {
            myParent[j] = i;
          } else {
            if (isAnc(i, myParent[j])) {
              myParent[j] = i;
            }
          }
        }
      }
    }
  }
  for (int i = 1; i <= q; ++i) {
    assert(myParent[i] != -1);
    adj[myParent[i]].push_back(i);
  }
  int root = 0;
  dfs(root);
  double exp = 0;
  for (int i = 0; i < ds[root].size(); ++i) {
    exp += ds[root][i].first * ds[root][i].second;
  }
  printf("%0.9lf\n", exp);
}
int main() {
  solve();
  return 0;
}