#include <bits/stdc++.h>
using namespace std;
const int MAXN = (int)1e5 + 5;
const int MAXM = (int)1e4 + 5;
const double eps = 1e-6;
struct segTreeNode {
  double data;
  double mark;
  int start;
  int end;
  segTreeNode *left;
  segTreeNode *right;
  segTreeNode(double d, double m, int s, int e, segTreeNode *l = NULL,
              segTreeNode *r = NULL) {
    data = d;
    mark = m;
    start = s;
    end = e;
    left = l;
    right = r;
  }
  segTreeNode() {
    data = 0;
    mark = 1;
  }
};
segTreeNode *build(const vector<int> &a, int start, int end) {
  if (start == end) {
    segTreeNode *root = new segTreeNode(a[start], 1, start, end);
    return root;
  }
  segTreeNode *root = new segTreeNode();
  int mid = (start + end) >> 1;
  root->left = build(a, start, mid);
  root->right = build(a, mid + 1, end);
  root->data = root->left->data + root->right->data;
  root->start = start;
  root->end = end;
  return root;
}
double query(segTreeNode *root, int qstart, int qend) {
  if (qstart > root->end || qend < root->start) {
    return 0;
  }
  if (root->start >= qstart && root->end <= qend) {
    return root->data;
  }
  return query(root->left, qstart, qend) + query(root->right, qstart, qend);
}
void pushDown(segTreeNode *root) {
  if (root->mark - 1 > eps || root->mark - 1 < -eps) {
    root->left->mark *= root->mark;
    root->right->mark *= root->mark;
    root->left->data *= root->mark;
    root->right->data *= root->mark;
    root->mark = 1.0;
  }
}
void update(segTreeNode *root, int ustart, int uend, double frac) {
  if (ustart > root->end || uend < root->start) {
    return;
  }
  if (root->data == 0) {
    return;
  }
  if (ustart <= root->start && uend >= root->end) {
    root->data *= frac;
    root->mark *= frac;
    return;
  }
  pushDown(root);
  update(root->left, ustart, uend, frac);
  update(root->right, ustart, uend, frac);
  root->data = root->left->data + root->right->data;
}
void del(segTreeNode *root) {
  if (root == NULL) return;
  del(root->left);
  del(root->right);
  delete root;
}
inline int binSearch(const vector<long long> &a, long long val, int start,
                     int end) {
  int mid;
  int l = start, r = end;
  while (l <= r) {
    mid = (l + r) >> 1;
    if (a[mid] == val) {
      return mid;
    } else if (a[mid] < val) {
      l = mid + 1;
    } else {
      r = mid - 1;
    }
  }
}
int main() {
  int n, m;
  long long a[MAXN];
  long long h[MAXN];
  int l[MAXN], r[MAXN];
  long long b[MAXM];
  int z[MAXM];
  while (scanf("%d%d", &n, &m) != EOF) {
    vector<long long> p;
    for (int i = 0; i < n; ++i) {
      scanf("%lld%lld%d%d", &a[i], &h[i], &l[i], &r[i]);
      p.push_back(a[i]);
      p.push_back(a[i] + 1);
      p.push_back(a[i] - 1);
      p.push_back(a[i] - h[i]);
      p.push_back(a[i] + h[i]);
    }
    for (int i = 0; i < m; ++i) {
      scanf("%lld%d", &b[i], &z[i]);
      p.push_back(b[i]);
    }
    sort(p.begin(), p.end());
    int c = unique(p.begin(), p.end()) - p.begin();
    vector<int> line(c, 0);
    for (int i = 0; i < m; ++i) {
      int treePos = binSearch(p, b[i], 0, c - 1);
      line[treePos] += z[i];
    }
    segTreeNode *root = build(line, 0, c - 1);
    for (int i = 0; i < n; ++i) {
      int left = binSearch(p, a[i] - h[i], 0, c - 1);
      int right = binSearch(p, a[i] - 1, 0, c - 1);
      update(root, left, right, (100.0 - l[i]) / 100);
      left = binSearch(p, a[i] + 1, 0, c - 1);
      right = binSearch(p, a[i] + h[i], 0, c - 1);
      update(root, left, right, (100.0 - r[i]) / 100);
    }
    printf("%lf\n", query(root, 0, c - 1));
    del(root);
  }
}
