Problem: Convex polygon pillar industrial city

The Industrial Convex Pillar City (ICPC) is a city of buildings in the shape of several convex polygonal columns. You are about to walk through this city from your current location S to your destination T. The sun is strong today, so I want to go to my destination without passing through the sun as much as possible. If the building is on a straight line connecting the point where you are standing and the sun, you are behind the building and will not be exposed to the sun. Also, since all the outer circumferences of the buildings in this city have eaves, while walking along the outer circumference of the buildings, even if you walk along the edge of the sun, you will not receive the sunlight. You are free to walk around the city anywhere except inside the building.

Create a program that outputs the walking distance of Hinata when walking from the current location to the destination so as not to receive the sun.

<image>

Figure E1: For the first input

<image>

Figure E2: For the second input

<image>

Figure E3: For the third input

Input

The input consists of multiple datasets. The maximum number of data sets does not exceed 30. Each dataset is represented in the following format.

> N
> NV1 H1 X1,1 Y1,1 X1,2 Y1,2 ... X1, NV1 Y1, NV1
> ...
> NVN HN XN, 1 YN, 1 XN, 2 YN, 2 ... XN, NVN YN, NVN
> θ φ
> Sx Sy Tx Ty
>

N in the first line represents the number of buildings. The following N lines specify the shape of each building. NVi represents the number of vertices of the polygon when the i-th building is viewed from above, and Hi represents the height of the i-th building. Xi, j and Yi, j represent the x-coordinate and y-coordinate of the j-th vertex of the polygon when the i-th building is viewed from above. The vertices are given in counterclockwise order. All buildings are convex polygons when viewed from above, and there are no other buildings inside the building, and the vertices and sides do not overlap with other polygons. The following lines are given θ and φ, which represent the direction of the sun, θ represents the direction of the sun as a counterclockwise angle from the positive direction of x, and φ is the elevation angle of the sun from the horizon, that is, looking up at the sun. It represents the angle between the direction of the line of sight and the ground surface. However, the sun is at infinity and does not change its position during movement. The following lines are given the coordinates of the current location and destination, (Sx, Sy) and (Tx, Ty).

> All the numerical values ​​given by the input are integers and satisfy the following conditions.

> 1 ≤ N ≤ 100
> 3 ≤ NVi ≤ 12
> 1 ≤ Hi ≤ 1,000
> 0 ≤ θ <360
> 0 <φ <90

All coordinates are -1,000 or more and 1,000 or less. The current location and the destination are different, and neither exists inside or outside the building.

> The end of the input is represented by a single zero line.

> ### Output

For each dataset, output the shortest walking distance in Hinata on one line. The output must not have an absolute error greater than 0.001.

> ### Sample Input


2
4 1 0 0 1 0 1 1 0 1
4 2 2 2 3 2 3 3 2 3
60 45
-1 -1 4 4
Four
4 1 0 0 3 1 1 2 0 1
3 2 10 7 8 2 12 4
6 8 7 12 8 13 9 15 10 19 11 24 10 25
5 4 16 2 16 4 12 8 14 2 15 0
167 38
3 3 15 21
12
4 3 -8 -3 -9 -3 -9 -5 -8 -6
4 5 -4 -5 -7 -5 -7 -6 -5 -6
4 2 -4 1 -5 1 -5 -4 -4 -4 -4
4 1 -1 1 -2 1 -2 -4 -1 -3
4 2 2 3 -1 3 -2 2 3 2
4 1 3 1 2 1 2 -3 3 -4
4 7 1 0 0 0 0 -1 1 -1
4 4 9 5 7 5 7 4 10 4
4 3 6 5 5 4 5 0 6 0
4 5 8 -1 5 -1 6 -2 8 -2
4 1 10 0 9 0 9 -2 10 -1
4 6 10 2 8 2 8 1 10 1
131 78
-10 10 10 -10
0


Output for Sample Input


1.93185
7.87174
20.86840





Example

Input

2
4 1 0 0 1 0 1 1 0 1
4 2 2 2 3 2 3 3 2 3
60 45
-1 -1 4 4
4
4 1 0 0 3 1 1 2 0 1
3 2 10 7 8 2 12 4
6 8 7 12 8 13 9 15 10 19 11 24 10 25
5 4 16 2 16 4 12 8 14 2 15 0
167 38
3 3 15 21
12
4 3 -8 -3 -9 -3 -9 -5 -8 -6
4 5 -4 -5 -7 -5 -7 -6 -5 -6
4 2 -4 1 -5 1 -5 -4 -4 -4
4 1 -1 1 -2 1 -2 -4 -1 -3
4 2 2 3 -1 3 -2 2 3 2
4 1 3 1 2 1 2 -3 3 -4
4 7 1 0 0 0 0 -1 1 -1
4 4 9 5 7 5 7 4 10 4
4 3 6 5 5 4 5 0 6 0
4 5 8 -1 5 -1 6 -2 8 -2
4 1 10 0 9 0 9 -2 10 -1
4 6 10 2 8 2 8 1 10 1
131 78
-10 10 10 -10
0


Output

1.93185
7.87174
20.86840

Solution (in CPP):

Solution:
#define _CRT_SECURE_NO_WARNINGS

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <list>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_set>
#include <unordered_map>
#include <array>
#include <cassert>
#include <bitset>
using namespace std;
using LL = long long;
using FLOAT = long double;
const FLOAT EPS = 1e-8;
const FLOAT INF = 1e12;
const FLOAT PI = acos(-1);
typedef complex<FLOAT> P;

namespace std {
	bool operator < (const P& a, const P& b) {
		return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);
	}
}


struct L : public vector<P> {
	L(const P& a, const P& b) {
		push_back(a); push_back(b);
	}
};
typedef vector<P> G;

FLOAT cross(const P& a, const P& b) {
	return imag(conj(a) * b);
}
FLOAT dot(const P& a, const P& b) {
	return real(conj(a) * b);
}

int ccw(P a, P b, P c) {
	b -= a; c -= a;
	if (cross(b, c) > 0)return 1;
	if (cross(b, c) < 0)return -1;
	if (dot(b, c) < 0)return 2;
	if (norm(b) < norm(c))return -2;
	return 0;
}

P projection(const L& l, const P& p) {
	FLOAT t = dot(p - l[0], l[0] - l[1]) / norm(l[0] - l[1]);
	return l[0] + t * (l[0] - l[1]);
}

bool intersectSS(const L & s, const L & t) {
	return ccw(s[0], s[1], t[0])* ccw(s[0], s[1], t[1]) <= 0 &&
		ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;
}

bool intersectSP(const L & s, const P & p) {
	return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < EPS;
}

FLOAT distanceSP(const L & s, const P & p) {
	const P r = projection(s, p);
	if (intersectSP(s, r))return abs(r - p);
	return min(abs(s[0] - p), abs(s[1] - p));
}

FLOAT distanceSS(const L & s, const L & t) {
	if (intersectSS(s, t))return 0;
	if (intersectSS(s, t))return 0;
	return min(min(distanceSP(s, t[0]), distanceSP(s, t[1])), min(distanceSP(t, s[0]), distanceSP(t, s[1])));
}

G convexHull(G ps) {
	int n = ps.size(), k = 0;
	assert(n >= 3);
	sort(ps.begin(), ps.end());
	G ch(2 * n);
	for (int i = 0; i < n; ch[k++] = ps[i++])
		while (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0)--k;
	for (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--])
		while (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0)--k;
	ch.resize(k - 1);
	return ch;
}

struct edge {
	int to;
	FLOAT cost;
	edge(int to, FLOAT cost) :to(to), cost(cost) {}
};
using Pair = pair<FLOAT, int>;
void dijkstra(vector<edge>graph[], FLOAT dist[], int n, int s) {
	priority_queue<Pair, vector<Pair>, greater<Pair>>que;
	que.push({ 0LL,s });
	fill(dist, dist + n, INF);
	dist[s] = 0LL;
	while (!que.empty()) {
		auto q = que.top();
		que.pop();
		FLOAT thd = q.first;
		int thv = q.second;
		if (thd > dist[thv])
			continue;
		for (auto ed : graph[thv]) {
			if (dist[ed.to] > ed.cost + thd) {
				dist[ed.to] = ed.cost + thd;
				que.push({ dist[ed.to] , ed.to });
			}
		}
	}
}

enum { OUT, ON, IN };
int contains(const G & poly, const P & point) {
	bool in = false;
	for (int i = 0; i < poly.size(); ++i) {
		P a = poly[i] - point, b = poly[(i + 1) % poly.size()] - point;
		if (imag(a) > imag(b)) swap(a, b);
		if (imag(a) <= 0 && 0 < imag(b))
			if (cross(a, b) < 0) in = !in;
		if (cross(a, b) == 0 && dot(a, b) <= 0) return ON;
	}
	return in ? IN : OUT;
}

//#define int long long

signed main() {
	int N;
	cout.precision(15);
	cout << fixed;
	while (cin >> N, N) {
		vector<FLOAT>H;
		vector<G>poly;
		vector<edge>graph[123];
		for (int i = 0; i < N; ++i) {
			int NV;
			cin >> NV;
			FLOAT h; cin >> h;
			H.push_back(h);
			poly.push_back(G());
			for (int j = 0; j < NV; ++j) {
				FLOAT x, y;
				cin >> x >> y;
				poly.back().push_back({ x,y });
			}
		}
		FLOAT the, phi;
		cin >> the >> phi;
		the *= (PI / 180);
		phi *= (PI / 180);
		the += PI;
		N += 2;
		FLOAT sx, sy, gx, gy;
		cin >> sx >> sy >> gx >> gy;
		poly.push_back(G(2, P(sx, sy)));
		H.push_back(0);
		poly.push_back(G(2, P(gx, gy)));
		H.push_back(0);
		P kiso(cos(the) / tan(phi), sin(the) / tan(phi));
		for (int i = 0; i < N; ++i) {
			G& g = poly[i], tmp;
			for (auto p : g) {
				tmp.push_back(p + kiso * H[i]);
			}
			for (auto p : tmp) {
				g.push_back(p);
			}
			g = convexHull(g);
		}
		for (int i = 0; i < N; ++i) {
			for (int j = 0; j < i; ++j) {
				FLOAT dist = INF;
				//i-j双方向に辺を張る
				for (int vi = 0; vi < poly[i].size(); vi++) {
					L L1 = { poly[i][vi],poly[i][(vi + 1) % poly[i].size()] };
					for (int vj = 0; vj < poly[j].size(); vj++) {
						L L2 = { poly[j][vj],poly[j][(vj + 1) % poly[j].size()] };
						dist = min(dist, distanceSS(L1, L2));
					}
				}
				if (j == N - 2 || j == N - 1) {
					if (contains(poly[i], poly[j][0])) {
						dist = 0;
					}
				}
				if (i == N - 2 || i == N - 1) {
					if (contains(poly[j], poly[i][0])) {
						dist = 0;
					}
				}
				graph[i].push_back({ j,dist });
				graph[j].push_back({ i,dist });
			}
		}
		FLOAT dist[123];
		dijkstra(graph, dist, N, N - 2);
		cout << dist[N - 1] << endl;
	}

}