Problem: One day Natalia was walking in the woods when she met a little mushroom gnome. The gnome told her the following story:

Everybody knows that the mushroom gnomes' power lies in the magic mushrooms that grow in the native woods of the gnomes. There are n trees and m magic mushrooms in the woods: the i-th tree grows at a point on a straight line with coordinates ai and has the height of hi, the j-th mushroom grows at the point with coordinates bj and has magical powers zj.

But one day wild mushroommunchers, the sworn enemies of mushroom gnomes unleashed a terrible storm on their home forest. As a result, some of the trees began to fall and crush the magic mushrooms. The supreme oracle of mushroom gnomes calculated in advance the probability for each tree that it will fall to the left, to the right or will stand on. If the tree with the coordinate x and height h falls to the left, then all the mushrooms that belong to the right-open interval [x - h, x), are destroyed. If a tree falls to the right, then the mushrooms that belong to the left-open interval (x, x + h] are destroyed. Only those mushrooms that are not hit by a single tree survive.

Knowing that all the trees fall independently of each other (i.e., all the events are mutually independent, and besides, the trees do not interfere with other trees falling in an arbitrary direction), the supreme oracle was also able to quickly calculate what would be the expectation of the total power of the mushrooms which survived after the storm. His calculations ultimately saved the mushroom gnomes from imminent death.

Natalia, as a good Olympiad programmer, got interested in this story, and she decided to come up with a way to quickly calculate the expectation of the sum of the surviving mushrooms' power.

Input

The first line contains two integers n and m (1 ≤ n ≤ 105, 1 ≤ m ≤ 104) — the number of trees and mushrooms, respectively.

Each of the next n lines contain four integers — ai, hi, li, ri (|ai| ≤ 109, 1 ≤ hi ≤ 109, 0 ≤ li, ri, li + ri ≤ 100) which represent the coordinate of the i-th tree, its height, the percentage of the probabilities that the tree falls to the left and to the right, respectively (the remaining percentage is the probability that the tree will stand on).

Each of next m lines contain two integers bj, zj (|bj| ≤ 109, 1 ≤ zj ≤ 103) which represent the coordinate and the magical power of the j-th mushroom, respectively.

An arbitrary number of trees and mushrooms can grow in one point.

Output

Print a real number — the expectation of the total magical power of the surviving mushrooms. The result is accepted with relative or absolute accuracy 10 - 4.

Examples

Input

1 1
2 2 50 50
1 1


Output

0.5000000000


Input

2 1
2 2 50 50
4 2 50 50
3 1


Output

0.2500000000

Note

It is believed that the mushroom with the coordinate x belongs to the right-open interval [l, r) if and only if l ≤ x < r. Similarly, the mushroom with the coordinate x belongs to the left-open interval (l, r] if and only if l < x ≤ r.

In the first test the mushroom survives with the probability of 50%, depending on where the single tree falls.

In the second test the mushroom survives only if neither of the two trees falls on it. It occurs with the probability of 50%  ×  50% = 25%.

Pretest №12 is the large test with 105 trees and one mushroom.

Solution (in JAVA):

Solution:


import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.StringTokenizer;

public class E {
    public static void main(String[] args) throws Exception {
        int treeCnt = nextInt();
        int mushCnt = nextInt();
        Integer[] ar = new Integer[4 * treeCnt + mushCnt];
        int[] treeP = new int[treeCnt];
        int[] treeH = new int[treeCnt];
        double[] leftProb = new double[treeCnt];
        double[] rightProb = new double[treeCnt];
        int idx = 0;
        for (int i = 0; i < treeCnt; i++) {
            int treePos = nextInt();
            treeP[i] = treePos;
            int treeHeight = nextInt();
            treeH[i] = treeHeight;
            ar[idx++] = treePos + 1;
            ar[idx++] = treePos + treeHeight;
            ar[idx++] = treePos - 1;
            ar[idx++] = treePos - treeHeight;
            leftProb[i] = nextInt() / 100.0;
            rightProb[i] = nextInt() / 100.0;
        }
        int[] mushPos = new int[mushCnt];
        int[] mushPower = new int[mushCnt];
        for (int i = 0; i < mushCnt; i++) {
            mushPos[i] = nextInt();
            mushPower[i] = nextInt();
            ar[idx++] = mushPos[i];
        }
        Arrays.sort(ar);
        HashMap<Integer, Integer> posMap = new HashMap<Integer, Integer>();
        idx = 0;
        int prev = Integer.MIN_VALUE;
        for (int i = 0; i < ar.length; i++) {
            if (ar[i] != prev) {
                prev = ar[i];
                posMap.put(ar[i], idx);
                idx++;
            }
        }
        SegmentTree survProb = new SegmentTree(ar.length);
        survProb.init(1);
        for (int i = 0; i < treeCnt; i++) {
            survProb.updateRange(posMap.get(treeP[i] + 1),
                    posMap.get(treeP[i] + treeH[i]), (1-rightProb[i]));
            survProb.updateRange(posMap.get(treeP[i] - treeH[i]),
                    posMap.get(treeP[i] - 1), (1-leftProb[i]));
        }
        double res=0;
        for (int i = 0; i < mushCnt; i++) {
            int mappedPos = posMap.get(mushPos[i]);
            res+=(survProb.query(mappedPos))
                    * mushPower[i];
        }
        System.out.println(res);
    }

    static class SegmentTree {
        double[] T;
//      int[] state;
        int size = 1;

        public SegmentTree(int n) {
            while (size < n)
                size <<= 1;
            T = new double[size << 1];
//          touched=new boolean[size<<1];
//          state = new int[size << 1];
        }

        public void init(int v) {
            Arrays.fill(T, v);
//          Arrays.fill(state, 0);
        }

//      public void updateTillRoot(int node) {
//          while (node >= 1) {
//              T[node] = T[node << 1] + T[(node << 1) + 1];
//              node >>= 1;
//          }
//      }

        public void updateRange(int i, int j, double val) {
            updateRange(1, 0, size - 1, i, j, val);
        }

        public void updateRange(int node, int nodeSt, int nodeEnd, int stRange,
                int endRange, double val) {
            if (nodeSt > endRange || nodeEnd < stRange)
                return;
            if (nodeSt >= stRange && nodeEnd <= endRange) {
                    T[node]*=val;
//              state[node] =1;
//              if (nodeEnd - nodeSt == 0) {
//                  state[node] = 0;
//              }
//              updateTillRoot(node >> 1);
                return;
            }
            int mid = (nodeSt + nodeEnd) >> 1;
//          if (state[node] != 0) {
//              propagate(node << 1, nodeSt, mid, T[node]);
//              propagate((node << 1) + 1, mid + 1, nodeEnd, T[node]);
//              state[node] = 0;
//          }
            updateRange(node << 1, nodeSt, mid, stRange, endRange, val);
            updateRange((node << 1) + 1, mid + 1, nodeEnd, stRange, endRange,
                    val);
        }

//      public void propagate(int node, int nodeSt, int nodeEnd, double val) {
//          state[node] = 1;
//          if(!touched[node]){
//              touched[node]=true;
//              T[node]=val;
//          }else{
//              T[node]*=val;
//          }
//          if (nodeEnd == nodeSt) {
//              state[node] = 0;
//          }
//      }

        // send query [i,j]
        public double query(int i) {
            return query(1, 0, size - 1, i);
        }
        public double query(int node,int beg,int end,int i){
            double res=T[node];
            if(beg==end){
                return res;
            }
            int mid=(beg+end)>>1;
            if(i<=mid){
                return res*query(2*node,beg,mid,i);
            }else{
                return res*query(2*node+1,mid+1,end,i);
            }
        }
//      private double query(int node, int b, int e, int i, int j) {
//          double p1, p2;
//          if (i > e || j < b)
//              return 0;
//          if (b >= i && e <= j)
//              return T[node];
//          if (state[node] != 0) {
//              propagate(node << 1, b, (b + e) >> 1, state[node]);
//              propagate((node << 1) + 1, ((b + e) >> 1) + 1, e, state[node]);
//              state[node] = 0;
//          }
//          p1 = query(2 * node, b, (b + e) >> 1, i, j);
//          p2 = query(2 * node + 1, ((b + e) >> 1) + 1, e, i, j);
//          return p1+p2;
//      }
    }

    static BufferedReader br = new BufferedReader(new InputStreamReader(
            System.in));
    static StringTokenizer st = new StringTokenizer("");

    static int nextInt() throws Exception {
        return Integer.parseInt(next());
    }

    static String next() throws Exception {
        while (true) {
            if (st.hasMoreTokens()) {
                return st.nextToken();
            }
            String s = br.readLine();
            if (s == null) {
                return null;
            }
            st = new StringTokenizer(s);
        }
    }
}