#include <bits/stdc++.h>
using namespace std;
const double pi = 3.1415926535;
const double eps = 1e-6;
double Cov[4100000];
int rec[4100000], all, a[410000], b[410000], z[410000], h[410000], l[410000],
    r[410000], n, m;
void cover(int l, int r, int p, int q, int now, double k) {
  if (p <= l && r <= q) {
    Cov[now] *= k;
  } else {
    if (Cov[now] + eps < 1) {
      Cov[now * 2] *= Cov[now];
      Cov[now * 2 + 1] *= Cov[now];
      Cov[now] = 1;
    }
    int mi = (l + r) / 2;
    if (p < mi) cover(l, mi, p, q, now * 2, k);
    if (mi < q) cover(mi, r, p, q, now * 2 + 1, k);
  }
}
double getsum(int l, int r, int p, int q, int now) {
  if (p <= l && r <= q) {
    return Cov[now];
  } else {
    if (Cov[now] + eps < 1) {
      Cov[now * 2] *= Cov[now];
      Cov[now * 2 + 1] *= Cov[now];
      Cov[now] = 1;
    }
    int mi = (l + r) / 2;
    double ans = 0;
    if (p < mi) ans += getsum(l, mi, p, q, now * 2);
    if (mi < q) ans += getsum(mi, r, p, q, now * 2 + 1);
    return ans;
  }
}
void build(int l, int r, int now) {
  Cov[now] = 1;
  if (r - l != 1) {
    int mi = (l + r) / 2;
    build(l, mi, now * 2);
    build(mi, r, now * 2 + 1);
  }
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++) {
    scanf("%d%d%d%d", a + i, h + i, l + i, r + i);
    rec[all++] = a[i];
    rec[all++] = a[i] - h[i];
    rec[all++] = a[i] + h[i];
  }
  for (int i = 0; i < m; i++) {
    scanf("%d%d", b + i, z + i);
    rec[all++] = b[i];
  }
  sort(rec, rec + all);
  all = unique(rec, rec + all) - rec;
  build(0, all, 1);
  for (int i = 0; i < n; i++) {
    int L = (lower_bound(rec, rec + all, a[i] - h[i]) - rec) + 1;
    int M = (lower_bound(rec, rec + all, a[i]) - rec) + 1;
    int R = (lower_bound(rec, rec + all, a[i] + h[i]) - rec) + 1;
    if (L < M) cover(0, all, L - 1, M - 1, 1, 1 - l[i] / 100.);
    if (M < R) cover(0, all, M, R, 1, 1 - r[i] / 100.);
  }
  double ans = 0;
  for (int i = 0; i < m; i++) {
    int M = (lower_bound(rec, rec + all, b[i]) - rec) + 1;
    ans += getsum(0, all, M - 1, M, 1) * z[i];
  }
  printf("%.5f\n", ans);
}
