#include <bits/stdc++.h>
using namespace std;
long double powr(long double a, int b) {
  if (b == 0) return 1;
  long double temp = powr(a, b / 2);
  if (b % 2 == 0) {
    return temp * temp;
  } else {
    return temp * temp * a;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long int n, m;
  cin >> n >> m;
  long long int a[n], h[n], l[n], r[n];
  for (long long int i = 0; i < n; ++i) {
    cin >> a[i] >> h[i] >> l[i] >> r[i];
  }
  pair<long long int, long long int> b[m];
  for (long long int i = 0; i < m; ++i) {
    cin >> b[i].first >> b[i].second;
  }
  sort(b, b + m);
  map<long long int, int[101]> m1;
  for (long long int i = 0; i < n; i++) {
    m1[a[i] - h[i]][100 - l[i]]++;
    m1[a[i]][100 - l[i]]--;
    m1[a[i] + 1][100 - r[i]]++;
    m1[a[i] + h[i] + 1][100 - r[i]]--;
  }
  int temp[101];
  memset(temp, 0, sizeof(temp));
  long double ans = 0;
  long long int in = 0;
  long double prev = 1;
  for (auto &it : m1) {
    if (in >= m) break;
    while (in < m && b[in].first < it.first) {
      ans += prev * (long double)b[in].second;
      in++;
    }
    prev = 1;
    long long int sum = 0;
    for (int i = 0; i <= 100; i++) {
      temp[i] += it.second[i];
      it.second[i] = temp[i];
      if (i != 100) sum += temp[i];
    }
    if (sum >= 3000) {
      prev = 0;
    } else {
      for (int i = 0; i <= 100; i++) {
        prev *= powr(i / (long double)100, it.second[i]);
      }
    }
  }
  for (long long int i = in; i < m; i++) {
    ans += b[i].second;
  }
  cout << fixed << setprecision(10) << ans << endl;
}
