#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 7;
double L[100010], R[100010];
int A[100010], h[100010], B[N], C[10010], D[10010];
double O[N << 2], laz[N << 2];
void build(int o, int l, int r) {
  laz[o] = 1;
  if (l == r) {
    O[o] = 1;
    return;
  }
  int mid = l + (r - l) / 2;
  build(o * 2, l, mid);
  build(o * 2 + 1, mid + 1, r);
  O[o] = O[o * 2] + O[o * 2 + 1];
}
void pushdown(int o) {
  if (laz[o] != 1) {
    laz[o * 2] *= laz[o];
    laz[o * 2 + 1] *= laz[o];
    O[o * 2] *= laz[o];
    O[o * 2 + 1] *= laz[o];
    laz[o] = 1;
  }
}
void update(int o, int l, int r, int x, int y, double p) {
  if (x <= l && r <= y) {
    O[o] *= p;
    laz[o] *= p;
    return;
  }
  int mid = l + (r - l) / 2;
  pushdown(o);
  if (x <= mid) update(o * 2, l, mid, x, y, p);
  if (y > mid) update(o * 2 + 1, mid + 1, r, x, y, p);
  O[o] = O[o * 2] + O[o * 2 + 1];
}
double query(int o, int l, int r, int x) {
  if (l == r) return O[o];
  int mid = l + (r - l) / 2;
  pushdown(o);
  if (x <= mid)
    return query(o * 2, l, mid, x);
  else
    return query(o * 2 + 1, mid + 1, r, x);
}
int main() {
  int n, m, c = 0;
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= n; i++) {
    scanf("%d %d %lf %lf", &A[i], &h[i], &L[i], &R[i]);
    L[i] /= 100;
    R[i] /= 100;
    B[++c] = A[i] - h[i];
    B[++c] = A[i] - 1;
    B[++c] = A[i] + h[i];
    B[++c] = A[i] + 1;
  }
  for (int i = 1; i <= m; i++) {
    scanf("%d %d", &C[i], &D[i]);
    B[++c] = C[i];
  }
  sort(B + 1, B + 1 + c);
  int u = unique(B + 1, B + 1 + c) - B - 1;
  build(1, 1, u);
  for (int i = 1; i <= n; i++) {
    int a = lower_bound(B + 1, B + 1 + u, A[i] - h[i]) - B;
    int b = lower_bound(B + 1, B + 1 + u, A[i] - 1) - B;
    update(1, 1, u, a, b, 1 - L[i]);
    a = lower_bound(B + 1, B + 1 + u, A[i] + 1) - B;
    b = lower_bound(B + 1, B + 1 + u, A[i] + h[i]) - B;
    update(1, 1, u, a, b, 1 - R[i]);
  }
  double ans = 0;
  for (int i = 1; i <= m; i++) {
    int a = lower_bound(B + 1, B + 1 + u, C[i]) - B;
    double p = query(1, 1, u, a);
    ans += p * D[i];
  }
  printf("%f\n", ans);
}
