Problem: Suppose that P1 is an infinite-height prism whose axis is parallel to the z-axis, and P2 is also an infinite-height prism whose axis is parallel to the y-axis. P1 is defined by the polygon C1 which is the cross section of P1 and the xy-plane, and P2 is also defined by the polygon C2 which is the cross section of P2 and the xz-plane.

Figure I.1 shows two cross sections which appear as the first dataset in the sample input, and Figure I.2 shows the relationship between the prisms and their cross sections.

<image>


Figure I.1: Cross sections of Prisms

<image>


Figure I.2: Prisms and their cross sections

<image>


Figure I.3: Intersection of two prisms

Figure I.3 shows the intersection of two prisms in Figure I.2, namely, P1 and P2.

Write a program which calculates the volume of the intersection of two prisms.



Input

The input is a sequence of datasets. The number of datasets is less than 200.

Each dataset is formatted as follows.

m n
x11 y11
x12 y12
.
.
.
x1m y1m
x21 z21
x22 z22
.
.
.
x2n z2n


m and n are integers (3 ≤ m ≤ 100, 3 ≤ n ≤ 100) which represent the numbers of the vertices of the polygons, C1 and C2, respectively.

x1i, y1i, x2j and z2j are integers between -100 and 100, inclusive. (x1i, y1i) and (x2j , z2j) mean the i-th and j-th vertices' positions of C1 and C2 respectively.

The sequences of these vertex positions are given in the counterclockwise order either on the xy-plane or the xz-plane as in Figure I.1.

You may assume that all the polygons are convex, that is, all the interior angles of the polygons are less than 180 degrees. You may also assume that all the polygons are simple, that is, each polygon's boundary does not cross nor touch itself.

The end of the input is indicated by a line containing two zeros.

Output

For each dataset, output the volume of the intersection of the two prisms, P1 and P2, with a decimal representation in a line.

None of the output values may have an error greater than 0.001. The output should not contain any other extra characters.

Example

Input

4 3
7 2
3 3
0 2
3 1
4 2
0 1
8 1
4 4
30 2
30 12
2 12
2 2
15 2
30 8
13 14
2 8
8 5
13 5
21 7
21 9
18 15
11 15
6 10
6 8
8 5
10 12
5 9
15 6
20 10
18 12
3 3
5 5
10 3
10 10
20 8
10 15
10 8
4 4
-98 99
-99 -99
99 -98
99 97
-99 99
-98 -98
99 -99
96 99
0 0


Output

4.708333333333333
1680.0000000000005
491.1500000000007
0.0
7600258.4847715655

Solution (in CPP):

Solution:
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <list>
#include <string.h>
using namespace std;
typedef long long int ll; typedef pair <int, int> P;
const double INF = 1000000000; const double EPS = 10e-9;
int x1[100], y[100], x2[100], z[100];
double width(int *X, int *Y, int n, double x) {
	double lb = -INF, ub = INF;
	for (int i = 0; i < n; i++)
	{
		double x1 = X[i], x2 = X[(i + 1) % n], y1 = Y[i], y2 = Y[(i + 1) % n];
		if ((x1 - x) * (x2 - x) > 0 || x1 == x2) continue;
		double y = y1 + (y2 - y1) * (x - x1) / (x2 - x1);
		lb = max(lb, y);
		ub = min(ub, y);
	}
	return max(0.0, lb - ub);
}
int main()
{
	while (true)
	{
		vector <int> x;
		int m, n; cin >> m >> n;
		if (m == 0 && n == 0) break;
		for (int i = 0; i < m; i++) {
			cin >> x1[i] >> y[i];
			x.push_back(x1[i]);
		}
		for (int i = 0; i < n; i++) {
			cin >> x2[i] >> z[i];
			x.push_back(x2[i]);
		}
		int minx1 = *min_element(x1, x1 + m), maxx1 = *max_element(x1, x1 + m);
		int minx2 = *min_element(x2, x2 + n), maxx2 = *max_element(x2, x2 + n);
		sort(x.begin(), x.end());
		double res = 0.0;
		for (int i = 0; i + 1 < m + n; i++)
		{
			double a = x[i], b = x[i + 1], c = (a + b) / 2;
			if (minx1 < c && c < maxx1 && minx2 < c && c < maxx2)
			{
				double sa = width(x1, y, m, a) * width(x2, z, n, a);
				double sb = width(x1, y, m, b) * width(x2, z, n, b);
				double sc = width(x1, y, m, c) * width(x2, z, n, c);
				res += (b - a) / 6 * (sa + sb + 4 * sc);
			}
		}
		printf("%.10f\n", res);
	}
	return 0;
}