#include <bits/stdc++.h>
using namespace std;
double sum[100005 << 4];
double col[100005 << 4];
struct po {
  int a, h;
  int l, r;
} tg[100005];
int pos[100005 << 3];
double power[100005];
int posm[100005];
void ups(int rt) {
  if (col[rt] != 1) {
    sum[rt << 1] *= col[rt];
    sum[rt << 1 | 1] *= col[rt];
    col[rt << 1] *= col[rt];
    col[rt << 1 | 1] *= col[rt];
    col[rt] = 1;
  }
}
void build(int l, int r, int rt) {
  col[rt] = 1;
  sum[rt] = 1;
  if (l == r) {
    return;
  }
  int mid = (l + r) >> 1;
  build(l, mid, rt << 1);
  build(mid + 1, r, rt << 1 | 1);
}
void updata(int L, int R, double c, int l, int r, int rt) {
  if (L <= l && r <= R) {
    col[rt] *= c;
    sum[rt] *= c;
    return;
  }
  ups(rt);
  int mid = (l + r) >> 1;
  if (L <= mid) updata(L, R, c, l, mid, rt << 1);
  if (mid < R) updata(L, R, c, mid + 1, r, rt << 1 | 1);
}
double query(int q, int l, int r, int rt) {
  if (l == r) return sum[rt];
  ups(rt);
  int mid = (l + r) >> 1;
  if (q <= mid) return query(q, l, mid, rt << 1);
  return query(q, mid + 1, r, rt << 1 | 1);
}
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  int cnt = 0;
  for (int i = 0; i < n; i++) {
    scanf("%d%d%d%d", &tg[i].a, &tg[i].h, &tg[i].l, &tg[i].r);
    pos[cnt++] = tg[i].a;
    pos[cnt++] = tg[i].a + tg[i].h;
    pos[cnt++] = tg[i].a - tg[i].h;
  }
  for (int i = 0; i < k; i++) {
    scanf("%d%lf", &posm[i], &power[i]);
    pos[cnt++] = posm[i];
  }
  sort(pos, pos + cnt);
  cnt = unique(pos, pos + cnt) - pos;
  build(0, cnt - 1, 1);
  for (int i = 0; i < n; i++) {
    int cur = lower_bound(pos, pos + cnt, tg[i].a) - pos;
    int ll = tg[i].a - tg[i].h;
    ll = lower_bound(pos, pos + cnt, ll) - pos;
    int rr = lower_bound(pos, pos + cnt, tg[i].a + tg[i].h) - pos;
    updata(ll, cur - 1, (100.00 - tg[i].l) / 100.0, 0, cnt - 1, 1);
    updata(cur + 1, rr, (100.00 - tg[i].r) / 100.0, 0, cnt - 1, 1);
  }
  double ans = 0;
  for (int i = 0; i < k; i++) {
    int cur = lower_bound(pos, pos + cnt, posm[i]) - pos;
    ans += power[i] * query(cur, 0, cnt - 1, 1);
  }
  printf("%.10lf\n", ans);
}
