#include <bits/stdc++.h>
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const int MAXN = 1e6 + 5;
const double eps = 1e-9;
using namespace std;
int n, m;
struct arr {
  int x, fl;
  double p;
};
arr a[MAXN];
int main() {
  scanf("%d", &(n)), scanf("%d", &(m));
  int k = 0;
  for (int i = 0; i < n; i++) {
    int x, h;
    double l, r;
    scanf("%d %d %lf %lf", &x, &h, &l, &r);
    if (l == 100) l -= 0.001;
    if (r == 100) r -= 0.001;
    a[k].x = x - h;
    a[k].p = log(1 - l / 100.);
    a[k++].fl = -1;
    a[k].x = x;
    a[k].p = -log(1 - l / 100.);
    a[k++].fl = -1;
    a[k].x = x;
    a[k].p = log(1 - r / 100.);
    a[k++].fl = 1;
    a[k].x = x + h;
    a[k].p = -log(1 - r / 100.);
    a[k++].fl = 1;
  }
  for (int i = 0; i < m; i++) {
    scanf("%d %lf", &a[k].x, &a[k].p);
    a[k++].fl = 0;
  }
  sort(a, a + k, [](arr lhs, arr rhs) -> bool {
    if (lhs.x == rhs.x) return lhs.fl < rhs.fl;
    return lhs.x < rhs.x;
  });
  double sum = 0, ans = 0;
  for (int i = 0; i < k; i++)
    if (a[i].fl)
      sum += a[i].p;
    else
      ans += a[i].p * exp(sum);
  printf("%.15f\n", ans);
  return 0;
}
