CF350D.Looking for Owls

Emperor Palpatine loves owls very much. The emperor has some blueprints with the new Death Star, the blueprints contain n distinct segments and m distinct circles. We will consider the segments indexed from 1 to n in some way and the circles — indexed from 1 to m in some way.

Palpatine defines an owl as a set of a pair of distinct circles (i, j) (i < j) and one segment k, such that:

1. circles i and j are symmetrical relatively to the straight line containing segment k;
2. circles i and j don't have any common points;
3. circles i and j have the same radius;
4. segment k intersects the segment that connects the centers of circles i and j.

Help Palpatine, count the number of distinct owls on the picture.

帕尔帕廷皇帝非常喜爱猫头鹰。皇帝拥有一些关于新型死星的设计图，这些设计图中包含 $n$ 条互不相同的线段和 $m$ 个互不相同的圆。我们将这些线段以某种方式编号为 $1$ 至 $n$，并将这些圆以某种方式编号为 $1$ 至 $m$。

帕尔帕廷将一只“猫头鹰”定义为一个三元组：一对互异的圆 $(i,\,j)$（其中 $i < j$）以及一条线段 $k$，满足以下条件：

1. 圆 $i$ 与圆 $j$ 关于包含线段 $k$ 的直线互为轴对称；
2. 圆 $i$ 与圆 $j$ 无任何公共点；
3. 圆 $i$ 与圆 $j$ 具有相同的半径；
4. 线段 $k$ 与连接圆 $i$ 和圆 $j$ 圆心的线段相交。

请帮助帕尔帕廷计算图中不同的“猫头鹰”的数量。

The first line contains two integers — n and m (1 ≤ n ≤ 3·105, 2 ≤ m ≤ 1500).

The next n lines contain four integers each, _x_1, _y_1, _x_2, _y_2 — the coordinates of the two endpoints of the segment. It's guaranteed that each segment has positive length.

The next m lines contain three integers each, x__i, y__i, r__i — the coordinates of the center and the radius of the i-th circle. All coordinates are integers of at most 104 in their absolute value. The radius is a positive integer of at most 104.

It is guaranteed that all segments and all circles are dictinct.

第一行包含两个整数 $n$ 和 $m$（$1 \leq n \leq 3 \cdot 10^5$，$2 \leq m \leq 1500$）。

接下来的 $n$ 行每行包含四个整数 $x_1, y_1, x_2, y_2$ —— 表示线段两个端点的坐标。保证每条线段长度为正。

接下来的 $m$ 行每行包含三个整数 $x_i, y_i, r_i$ —— 表示第 $i$ 个圆的圆心坐标和半径。所有坐标的绝对值不超过 $10^4$；半径为正整数，且不超过 $10^4$。

保证所有线段互不相同，所有圆也互不相同。

Print a single number — the answer to the problem.

Please, do not use the %lld specifier to output 64-bit integers is С++. It is preferred to use the cout stream or the %I64d specifier.

输出一个整数——即该问题的答案。

请注意，在 C++ 中不要使用 %lld 格式说明符来输出 64 位整数。推荐使用 cout 流或 %I64d 格式说明符。

Here's an owl from the first sample. The owl is sitting and waiting for you to count it.

这是第一个样例中的猫头鹰。猫头鹰正坐着，等待你来数它。