#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, cnt[101] = {};
  pair<int, int> a[10000];
  deque<pair<int, int> > u;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++) {
    int x, y, pl, pr;
    scanf("%d%d%d%d", &x, &y, &pl, &pr);
    u.push_back({x - y, pl});
    u.push_back({x, -pl});
    u.push_back({x + 1, pr});
    u.push_back({x + y + 1, -pr});
  }
  sort(u.begin(), u.end());
  u.push_back({1000000007, 0});
  for (int i = 0; i < m; i++) scanf("%d%d", &a[i].first, &a[i].second);
  sort(a, a + m);
  double ans = 0;
  for (int i = 0; i < m; i++) {
    while (u.front().first <= a[i].first) {
      int x = u.front().second;
      if (x > 0) cnt[+x]++;
      if (x < 0) cnt[-x]--;
      u.pop_front();
    }
    double now = a[i].second;
    for (int j = 1; j <= 100; j++) now *= pow(0.01 * (100 - j), cnt[j]);
    if (!cnt[100]) ans += now;
  }
  printf("%.14f\n", ans);
}
