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:
/**
 * Created by IntelliJ IDEA.
 * User: jte
 * Date: 12/24/11
 * Time: 8:53 AM
 * To change this template use File | Settings | File Templates.
 */

import java.io.*;
import java.util.*;

public class TaskC extends Thread {
    public TaskC(int what) {
        try {
            if (what == 0) {
                this.input = new BufferedReader(new InputStreamReader(System.in));
                this.output = new PrintWriter(System.out);
            } else {
                this.input = new BufferedReader(new FileReader(INPUT_FILE));
                this.output = new PrintWriter(OUTPUT_FILE);
            }
        } catch (Throwable e) {
            e.printStackTrace();
            System.exit(666);
        }
    }

    public static int lowerBound(int[] a, int key, int SIZE) {
        int lo = -1;
        int hi = SIZE;
        while (hi - lo > 1) {
            int mid = (lo + hi) / 2;
            long midVal = a[mid];
            if (midVal < key) {
                lo = mid;
            } else {
                hi = mid;
            }
        }
        return hi;
    }

    double[] t;

    void build(int v, int tl, int tr) {
        if (tl == tr) {
            t[v] = 0;
        } else {
            int tm = (tl + tr) >> 1;
            build(v + v, tl, tm);
            build(v + v + 1, tm + 1, tr);
        }
    }

    void update(int v, int tl, int tr, int l, int r, double add) {
        if (l > r) {
            return;
        }
        if (l == tl && r == tr) {
            t[v] += add;
        } else {
            int tm = (tl + tr) >> 1;
            update(v + v, tl, tm, l, Math.min(r, tm), add);
            update(1 + v + v, tm + 1, tr, Math.max(l, tm + 1), r, add);
        }
    }

    double get(int v, int tl, int tr, int pos) {
        if (tl == tr) {
            return t[v];
        } else {
            int tm = (tl + tr) >> 1;
            if (pos <= tm) {
                return t[v] + get(v + v, tl, tm, pos);
            } else {
                return t[v] + get(1 + v + v, tm + 1, tr, pos);
            }
        }
    }

    static class Mushroom implements Comparable<Mushroom> {
        int where;
        int cost;

        public Mushroom(int where, int cost) {
            this.where = where;
            this.cost = cost;
        }

        public int compareTo(Mushroom o) {
            return this.where - o.where;
        }
    }

    private void solve() throws Throwable {
        int n = nextInt();
        int m = nextInt();
        int[] a = new int[n];
        int[] h = new int[n];
        int[] l = new int[n];
        int[] r = new int[n];
        for (int i = 0; i < n; ++i) {
            a[i] = nextInt();
            h[i] = nextInt();
            l[i] = nextInt();
            r[i] = nextInt();
        }
        Mushroom[] mushrooms = new Mushroom[m];
        for (int i = 0; i < m; ++i) {
            mushrooms[i] = new Mushroom(nextInt(), nextInt());
        }
        Arrays.sort(mushrooms);
        int coord[] = new int[m];
        int cost[] = new int[m];
        int SIZE = 0;
        int last = mushrooms[0].where;
        coord[0] = last;
        cost[0] = mushrooms[0].cost;
        for (int i = 1; i < m; ++i) {
            if (mushrooms[i].where != last) {
                ++SIZE;
                coord[SIZE] = mushrooms[i].where;
                cost[SIZE] = mushrooms[i].cost;
                last = mushrooms[i].where;
            } else {
                cost[SIZE] += mushrooms[i].cost;
            }
        }
        ++SIZE;
        t = new double[SIZE << 2];
        build(1, 0, SIZE - 1);
        for (int i = 0; i < n; ++i) {
            int left, right;
            left = lowerBound(coord, a[i] - h[i], SIZE);
            right = lowerBound(coord, a[i] + 1, SIZE);

            while (right >= SIZE) {
                --right;
            }
            while (right >= 0 && coord[right] > a[i] - 1) {
                --right;
            }
            double now = (double)(100 - l[i]);
            now /= 100;
            now = Math.log(now);
            if (left <= right)
                update(1, 0, SIZE - 1, left, right, now);

            left = lowerBound(coord, a[i] + 1, SIZE);
            right = lowerBound(coord, a[i] + h[i], SIZE);
            while (right >= SIZE) {
                --right;
            }
            while (right >= 0 && coord[right] > a[i] + h[i]) {
                --right;
            }
            now = (double)(100 - r[i]);
            now /= 100;
            now = Math.log(now);
            if (left <= right)
                update(1, 0, SIZE - 1, left, right, now);
        }

        double expected = .0;
        for (int i = 0; i < SIZE; ++i) {
            expected += Math.exp(get(1, 0, SIZE - 1, i)) * cost[i];
        }
        output.printf("%.10f", expected);
    }

    public void run() {
        try {
            solve();
        } catch (Throwable e) {
            e.printStackTrace();
            System.exit(666);
        } finally {
            output.flush();
            output.close();
        }
    }


    public static void main(String... args) {
        new TaskC(0).start();
    }

    private String nextToken() throws IOException {
        while (tokens == null || !tokens.hasMoreTokens()) {
            tokens = new StringTokenizer(input.readLine());
        }
        return tokens.nextToken();
    }

    private int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    private double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }

    private long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }

    private String INPUT_FILE = null;
    private String OUTPUT_FILE = null;
    private BufferedReader input;
    private PrintWriter output;
    private StringTokenizer tokens = null;
}