CF1401E.Divide Square

There is a square of size $10^6 \times 10^6$ on the coordinate plane with four points $(0, 0)$, $(0, 10^6)$, $(10^6, 0)$, and $(10^6, 10^6)$ as its vertices.

You are going to draw segments on the plane. All segments are either horizontal or vertical and intersect with at least one side of the square.

Now you are wondering how many pieces this square divides into after drawing all segments. Write a program calculating the number of pieces of the square.

在坐标平面上有一个边长为 $10^6 \times 10^6$ 的正方形，其四个顶点分别为 $(0, 0)$、$(0, 10^6)$、$(10^6, 0)$ 和 $(10^6, 10^6)$。

你将在该平面上绘制若干线段。所有线段均为水平或垂直方向，且每条线段至少与正方形的一条边相交。

现在你想知道：在绘制完所有线段后，该正方形被分成了多少个区域？请编写一个程序计算正方形被分割出的区域数量。

The first line contains two integers $n$ and $m$ ($0 \le n, m \le 10^5$) — the number of horizontal segments and the number of vertical segments.

The next $n$ lines contain descriptions of the horizontal segments. The $i$-th line contains three integers $y_i$, $lx_i$ and $rx_i$ ($0 \lt y_i \lt 10^6$; $0 \le lx_i \lt rx_i \le 10^6$), which means the segment connects $(lx_i, y_i)$ and $(rx_i, y_i)$.

The next $m$ lines contain descriptions of the vertical segments. The $i$-th line contains three integers $x_i$, $ly_i$ and $ry_i$ ($0 \lt x_i \lt 10^6$; $0 \le ly_i \lt ry_i \le 10^6$), which means the segment connects $(x_i, ly_i)$ and $(x_i, ry_i)$.

It's guaranteed that there are no two segments on the same line, and each segment intersects with at least one of square's sides.

第一行包含两个整数 $n$ 和 $m$（$0 \le n, m \le 10^5$），分别表示水平线段的数量和垂直线段的数量。

接下来的 $n$ 行描述水平线段。第 $i$ 行包含三个整数 $y_i$、$lx_i$ 和 $rx_i$（$0 \lt y_i \lt 10^6$；$0 \le lx_i \lt rx_i \le 10^6$），表示该线段连接点 $(lx_i, y_i)$ 和 $(rx_i, y_i)$。

接下来的 $m$ 行描述垂直线段。第 $i$ 行包含三个整数 $x_i$、$ly_i$ 和 $ry_i$（$0 \lt x_i \lt 10^6$；$0 \le ly_i \lt ry_i \le 10^6$），表示该线段连接点 $(x_i, ly_i)$ 和 $(x_i, ry_i)$。

保证不存在两条线段位于同一条直线上，且每条线段至少与正方形的一条边相交。

Print the number of pieces the square is divided into after drawing all the segments.

画出所有线段后，输出正方形被分割成的块数。

The sample is like this:

示例图如下：