#include <bits/stdc++.h>
using namespace std;
using namespace std;
vector<pair<int, int> > mushrom;
vector<pair<int, int> > tree;
const int maxn = 100005;
double l[maxn], r[maxn], s[maxn];
int n, m;
int z[maxn];
double p[maxn];
int main() {
  std::ios_base::sync_with_stdio(false);
  cout << fixed;
  cout << setprecision(6);
  cin >> n >> m;
  for (int i = 0; i < n; ++i) {
    int a, h;
    cin >> a >> h;
    tree.push_back(pair<int, int>(a, h));
    cin >> l[i] >> r[i];
    s[i] = 100 - (l[i] + r[i]);
    s[i] /= 100.0;
    l[i] /= 100.0, r[i] /= 100.0;
  }
  for (int i = 0; i < maxn; ++i) p[i] = 1.0;
  for (int j = 0; j < m; ++j) {
    int a, z;
    cin >> a >> z;
    mushrom.push_back(pair<int, int>(a, z));
  }
  mushrom.push_back(pair<int, int>(1 << 30, 1 << 30));
  sort((mushrom).begin(), (mushrom).end());
  for (int i = 0; i < n; ++i) {
    double prob = s[i] + r[i];
    vector<pair<int, int> >::iterator it1 =
        lower_bound((mushrom).begin(), (mushrom).end(),
                    pair<int, int>(tree[i].first - tree[i].second, -1));
    vector<pair<int, int> >::iterator it2 = lower_bound(
        (mushrom).begin(), (mushrom).end(), pair<int, int>(tree[i].first, -1));
    if (prob == 0.0) {
      z[it1 - mushrom.begin()]++;
      z[it2 - mushrom.begin()]--;
    } else {
      p[it1 - mushrom.begin()] *= prob;
      p[it2 - mushrom.begin()] /= prob;
    }
    prob = s[i] + l[i];
    it1 = lower_bound((mushrom).begin(), (mushrom).end(),
                      pair<int, int>(tree[i].first + 1, -1));
    it2 = lower_bound((mushrom).begin(), (mushrom).end(),
                      pair<int, int>(tree[i].first + tree[i].second + 1, -1));
    if (prob == 0.0) {
      z[it1 - mushrom.begin()]++;
      z[it2 - mushrom.begin()]--;
    } else {
      p[it1 - mushrom.begin()] *= prob;
      p[it2 - mushrom.begin()] /= prob;
    }
  }
  for (int i = 1; i < m; ++i) p[i] *= p[i - 1], z[i] += z[i - 1];
  double s = 0.0;
  for (int i = 0; i < m; ++i) {
    if (z[i] == 0) s += 1.0 * p[i] * mushrom[i].second;
  }
  cout << s << "\n";
}
