#include <bits/stdc++.h>
using namespace std;
int n, m, a, h, l, r, b, z, p[111];
vector<pair<int, int> > t;
pair<int, int> mu[10010];
int main() {
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    cin >> a >> h >> l >> r;
    t.push_back(pair<int, int>(a - h, l));
    t.push_back(pair<int, int>(a, -l));
    t.push_back(pair<int, int>(a + 1, r));
    t.push_back(pair<int, int>(a + h + 1, -r));
  }
  t.push_back(pair<int, int>(1000000007LL, 0));
  sort(t.begin(), t.end());
  for (int i = 0; i < m; i++) cin >> mu[i].first >> mu[i].second;
  sort(mu, mu + m);
  double ans = 0;
  int cur = 0;
  for (int i = 0; i < m; i++) {
    while (t[cur].first <= mu[i].first) {
      if (t[cur].second > 0)
        p[t[cur].second]++;
      else
        p[-t[cur].second]--;
      cur++;
    }
    double x = mu[i].second;
    for (int j = 0; j < 101; j++) x *= pow(1 - j / 100., p[j]);
    ans += x;
  }
  cout << ans;
}
