#include <bits/stdc++.h>
using namespace std;
inline long long int modadd(long long int n, long long int m,
                            long long int p = 1000000007) {
  return ((n + m) % p + p) % p;
}
inline long long int modsub(long long int n, long long int m,
                            long long int p = 1000000007) {
  return ((n - m + p) % p + p) % p;
}
inline long long int modpro(long long int n, long long int m,
                            long long int p = 1000000007) {
  return (((n % p) * (m % p)) % p + p) % p;
}
unsigned long long int powe(long long int first, long long int second) {
  unsigned long long int res = 1;
  while (second > 0) {
    if (second & 1) res = res * first;
    second = second >> 1;
    first = first * first;
  }
  return res;
}
long long int modpow(long long int first, long long int second,
                     long long int p = 1000000007) {
  long long int res = 1;
  while (second > 0) {
    if (second & 1) res = modpro(res, first, p);
    second = second >> 1;
    first = modpro(first, first, p);
  }
  return res;
}
inline long long int modInverse(long long int n, long long int p = 1000000007) {
  if (n == 1) return 1;
  return modpow(n, p - 2, p);
}
inline long long int moddiv(long long int n, long long int m,
                            long long int p = 1000000007) {
  return modpro(n, modInverse(m, p), p);
}
inline long long int modadd3(long long int first, long long int second,
                             long long int z, long long int p = 1000000007) {
  return modadd(modadd(first, second, p), z, p);
}
inline long long int modadd4(long long int first, long long int second,
                             long long int z, long long int w,
                             long long int p = 1000000007) {
  return modadd(modadd(first, second, p), modadd(z, w, p), p);
}
inline long long int modnCr(long long int fac[], int n, int r,
                            long long int p = 1000000007) {
  if (r == 0) return 1;
  return modpro(fac[n], modInverse(modpro(fac[r], fac[n - r], p), p), p);
}
template <typename T>
inline T max3(T first, T second, T z) {
  return max(max(first, second), z);
}
template <typename T>
inline T max4(T first, T second, T z, T w) {
  return max(max3(first, second, w), z);
}
template <typename T>
inline T min3(T first, T second, T z) {
  return min(min(first, second), z);
}
template <typename T>
inline T min4(T first, T second, T z, T w) {
  return min(min3(first, second, w), z);
}
template <typename T>
void printArr(T *arr, int s, int n) {
  for (int i = s; i <= n; i++) {
    cout << arr[i] << " ";
  }
  cout << endl;
}
int a[100009], h[100009], l[100009], r[100009], b[100009], z[100009];
int cn[101];
long double mp(int first, int pow) {
  long double res = 1;
  long double xp = (long double)first / 100;
  while (pow) {
    if (pow % 2) res *= xp;
    pow >>= 1;
    xp *= xp;
  }
  return res;
}
vector<pair<int, pair<int, int>>> v;
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  int erer = 1;
  for (int erer2 = (1); erer2 < (erer + 1); erer2++) {
    int n, m;
    cin >> n >> m;
    for (int i = (0); i < (n); i++) {
      cin >> a[i] >> h[i] >> l[i] >> r[i];
      v.push_back({a[i] - h[i], {1, l[i]}});
      v.push_back({a[i], {0, l[i]}});
      v.push_back({a[i] + 1, {1, r[i]}});
      v.push_back({a[i] + h[i] + 1, {0, r[i]}});
    }
    for (int i = (0); i < (m); i++) {
      cin >> b[i] >> z[i];
      v.push_back({b[i], {2, z[i]}});
    }
    long double ans = 0;
    sort(v.begin(), v.end());
    for (auto u : v) {
      if (u.second.first == 2) {
        long double temp = 1;
        for (int i = (0); i < (101); i++) {
          temp *= mp(100 - i, cn[i]);
        }
        ans += ((temp)*u.second.second);
      } else if (u.second.first) {
        cn[u.second.second]++;
      } else
        cn[u.second.second]--;
    }
    cout << fixed << setprecision(9) << ans << endl;
  }
  return 0;
}
