Problem: One day Natalia was walking in the woods when she met a little mushroom gnome. The gnome told her the following story:

Everybody knows that the mushroom gnomes' power lies in the magic mushrooms that grow in the native woods of the gnomes. There are n trees and m magic mushrooms in the woods: the i-th tree grows at a point on a straight line with coordinates ai and has the height of hi, the j-th mushroom grows at the point with coordinates bj and has magical powers zj.

But one day wild mushroommunchers, the sworn enemies of mushroom gnomes unleashed a terrible storm on their home forest. As a result, some of the trees began to fall and crush the magic mushrooms. The supreme oracle of mushroom gnomes calculated in advance the probability for each tree that it will fall to the left, to the right or will stand on. If the tree with the coordinate x and height h falls to the left, then all the mushrooms that belong to the right-open interval [x - h, x), are destroyed. If a tree falls to the right, then the mushrooms that belong to the left-open interval (x, x + h] are destroyed. Only those mushrooms that are not hit by a single tree survive.

Knowing that all the trees fall independently of each other (i.e., all the events are mutually independent, and besides, the trees do not interfere with other trees falling in an arbitrary direction), the supreme oracle was also able to quickly calculate what would be the expectation of the total power of the mushrooms which survived after the storm. His calculations ultimately saved the mushroom gnomes from imminent death.

Natalia, as a good Olympiad programmer, got interested in this story, and she decided to come up with a way to quickly calculate the expectation of the sum of the surviving mushrooms' power.

Input

The first line contains two integers n and m (1 ≤ n ≤ 105, 1 ≤ m ≤ 104) — the number of trees and mushrooms, respectively.

Each of the next n lines contain four integers — ai, hi, li, ri (|ai| ≤ 109, 1 ≤ hi ≤ 109, 0 ≤ li, ri, li + ri ≤ 100) which represent the coordinate of the i-th tree, its height, the percentage of the probabilities that the tree falls to the left and to the right, respectively (the remaining percentage is the probability that the tree will stand on).

Each of next m lines contain two integers bj, zj (|bj| ≤ 109, 1 ≤ zj ≤ 103) which represent the coordinate and the magical power of the j-th mushroom, respectively.

An arbitrary number of trees and mushrooms can grow in one point.

Output

Print a real number — the expectation of the total magical power of the surviving mushrooms. The result is accepted with relative or absolute accuracy 10 - 4.

Examples

Input

1 1
2 2 50 50
1 1


Output

0.5000000000


Input

2 1
2 2 50 50
4 2 50 50
3 1


Output

0.2500000000

Note

It is believed that the mushroom with the coordinate x belongs to the right-open interval [l, r) if and only if l ≤ x < r. Similarly, the mushroom with the coordinate x belongs to the left-open interval (l, r] if and only if l < x ≤ r.

In the first test the mushroom survives with the probability of 50%, depending on where the single tree falls.

In the second test the mushroom survives only if neither of the two trees falls on it. It occurs with the probability of 50%  ×  50% = 25%.

Pretest №12 is the large test with 105 trees and one mushroom.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int INF = INT_MAX;
const long long INFL = LLONG_MAX;
const long double pi = acos(-1);
int N, M;
struct Tree {
  int a, h, l, r;
} T[100100];
struct Mushroom {
  int b, z;
} MR[10010];
const int ARY_SIZE = 500100;
vector<int> v;
int get_index(int x) {
  int lb = (int)(lower_bound(v.begin(), v.end(), x) - v.begin());
  int ub = (int)(upper_bound(v.begin(), v.end(), x) - v.begin());
  if (lb == ub) return -1;
  return lb;
}
struct node {
  double sum;
  int width;
  node operator+(const node &n) const { return {sum * n.sum, width + n.width}; }
};
struct update {
  bool type;
  double value;
  node operator()(const node &n) const {
    if (type)
      return {n.width * value, n.width};
    else {
      if (n.sum * value < 1e-10) {
        return {0, n.width};
      } else {
        return {n.sum * value, n.width};
      }
    }
  }
  update operator+(const update &u) const {
    if (u.type)
      return u;
    else {
      if (value * u.value < 1e-10) {
        return {type, 0};
      } else {
        return {type, value * u.value};
      }
    }
  }
};
template <typename T, typename U>
struct seg_tree_lazy {
  int S, H;
  T zero;
  vector<T> value;
  U noop;
  vector<bool> dirty;
  vector<U> prop;
  seg_tree_lazy<T, U>(int _S, T _zero = T(), U _noop = U()) {
    zero = _zero, noop = _noop;
    for (S = 1, H = 1; S < _S;) S *= 2, H++;
    value.resize(2 * S, zero);
    dirty.resize(2 * S, false);
    prop.resize(2 * S, noop);
  }
  void set_leaves(vector<T> &leaves) {
    copy(leaves.begin(), leaves.end(), value.begin() + S);
    for (int i = S - 1; i > 0; i--) value[i] = value[2 * i] + value[2 * i + 1];
  }
  void apply(int i, U &update) {
    value[i] = update(value[i]);
    if (i < S) {
      prop[i] = prop[i] + update;
      dirty[i] = true;
    }
  }
  void rebuild(int i) {
    for (int l = i / 2; l; l /= 2) {
      T combined = value[2 * l] + value[2 * l + 1];
      value[l] = prop[l](combined);
    }
  }
  void propagate(int i) {
    for (int h = H; h > 0; h--) {
      int l = i >> h;
      if (dirty[l]) {
        apply(2 * l, prop[l]);
        apply(2 * l + 1, prop[l]);
        prop[l] = noop;
        dirty[l] = false;
      }
    }
  }
  void upd(int i, int j, U update) {
    i += S, j += S;
    propagate(i), propagate(j);
    for (int l = i, r = j; l <= r; l /= 2, r /= 2) {
      if ((l & 1) == 1) apply(l++, update);
      if ((r & 1) == 0) apply(r--, update);
    }
    rebuild(i), rebuild(j);
  }
  T query(int i, int j) {
    i += S, j += S;
    propagate(i), propagate(j);
    T res_left = zero, res_right = zero;
    for (; i <= j; i /= 2, j /= 2) {
      if ((i & 1) == 1) res_left = res_left + value[i++];
      if ((j & 1) == 0) res_right = value[j--] + res_right;
    }
    return res_left + res_right;
  }
};
int main() {
  ios_base::sync_with_stdio(0);
  cout.precision(15);
  cout << fixed;
  cout.tie(0);
  cin.tie(0);
  cin >> N >> M;
  for (int(i) = 1; (i) <= (N); (i)++)
    cin >> T[i].a >> T[i].h >> T[i].l >> T[i].r;
  for (int(i) = 1; (i) <= (M); (i)++) cin >> MR[i].b >> MR[i].z;
  for (int(i) = 1; (i) <= (N); (i)++) v.push_back(T[i].a + 1);
  for (int(i) = 1; (i) <= (N); (i)++) v.push_back(T[i].a - 1);
  for (int(i) = 1; (i) <= (N); (i)++) v.push_back(T[i].a + T[i].h);
  for (int(i) = 1; (i) <= (N); (i)++) v.push_back(T[i].a - T[i].h);
  for (int(i) = 1; (i) <= (M); (i)++) v.push_back(MR[i].b);
  sort(v.begin(), v.end());
  v.erase(unique(v.begin(), v.end()), v.end());
  seg_tree_lazy<node, update> st(int((v).size()), {1, 0}, {false, 1});
  vector<node> leaves(int((v).size()), {1, 1});
  st.set_leaves(leaves);
  double answer = 0;
  for (int(i) = 1; (i) <= (N); (i)++) {
    st.upd(get_index(T[i].a - T[i].h), get_index(T[i].a - 1),
           {0, (100 - T[i].l) * 1.0 / 100});
    st.upd(get_index(T[i].a + 1), get_index(T[i].a + T[i].h),
           {0, (100 - T[i].r) * 1.0 / 100});
  }
  for (int(j) = 1; (j) <= (M); (j)++)
    answer +=
        MR[j].z * 1.0 * st.query(get_index(MR[j].b), get_index(MR[j].b)).sum;
  cout << answer << '\n';
}