#include <bits/stdc++.h>
using namespace std;
const int N = 401000;
const double eps = 1e-8;
int col[N << 2];
double pp[N << 2];
int n, m;
int a[N];
int heigh[N];
int ll[N];
int rr[N];
int loc;
int power;
int xx[N];
void PushDown(int rt) {
  if (col[rt]) {
    col[rt << 1] = col[rt << 1 | 1] = col[rt];
    pp[rt << 1] *= pp[rt];
    pp[rt << 1 | 1] *= pp[rt];
    col[rt] = 0;
    pp[rt] = 1;
  }
}
void build(int l, int r, int rt) {
  col[rt] = 0;
  pp[rt] = 1.0;
  if (l == r) return;
  int m = (l + r) >> 1;
  build(l, m, rt << 1);
  build(m + 1, r, rt << 1 | 1);
}
void update(int L, int R, int c, int l, int r, int rt) {
  if (L <= l && r <= R) {
    col[rt] = 1;
    pp[rt] *= 1.0 - 1.0 * c / 100.0;
    return;
  }
  PushDown(rt);
  int m = (l + r) >> 1;
  if (L <= m) update(L, R, c, l, m, rt << 1);
  if (R > m) update(L, R, c, m + 1, r, rt << 1 | 1);
}
double found(int loc, int l, int r, int rt) {
  if (l == r) {
    return pp[rt];
  }
  PushDown(rt);
  int m = (l + r) >> 1;
  if (loc <= m)
    return found(loc, l, m, rt << 1);
  else
    return found(loc, m + 1, r, rt << 1 | 1);
}
int main() {
  while (scanf("%d%d", &n, &m) != EOF) {
    int i, j;
    int cnt = 0;
    for (i = 0; i < n; i++) {
      scanf("%d%d%d%d", a + i, heigh + i, ll + i, rr + i);
      xx[cnt++] = a[i] - heigh[i];
      xx[cnt++] = a[i];
      xx[cnt++] = a[i] + 1;
      xx[cnt++] = a[i] + heigh[i] + 1;
    }
    xx[cnt++] = -2100000000;
    xx[cnt++] = 2100000000;
    sort(xx, xx + cnt);
    cnt = unique(xx, xx + cnt) - xx;
    cnt--;
    build(0, cnt - 1, 1);
    for (i = 0; i < n; i++) {
      int lef = lower_bound(xx, xx + cnt, a[i] - heigh[i]) - xx;
      int rig = lower_bound(xx, xx + cnt, a[i]) - xx;
      update(lef, rig - 1, ll[i], 0, cnt - 1, 1);
      lef = lower_bound(xx, xx + cnt, a[i] + 1) - xx;
      rig = lower_bound(xx, xx + cnt, a[i] + heigh[i] + 1) - xx;
      update(lef, rig - 1, rr[i], 0, cnt - 1, 1);
    }
    double ans = 0;
    for (i = 0; i < m; i++) {
      scanf("%d%d", &loc, &power);
      int lef = upper_bound(xx, xx + cnt, loc) - xx - 1;
      double temp1 = found(lef, 0, cnt - 1, 1);
      ans += temp1 * power;
    }
    printf("%lf\n", ans);
  }
}
