???Visible Surface
In computer graphics rendering it is required to do hidden surface removal, the first step in hidden surface removal is to determine the visible surfaces. In this problem you are asked to write a program to find all visible surfaces from a convex block which consists of many surfaces given an arbitrary view point, where each surface is a polygon and is determined by a number of vertices. For example, in Figure 1 there is a convex block consists of 10 surfaces and a view point V . The surfaces 1, 2, and 3 are visible to the view point V, whose coordinate is (2,3,4), and surfaces 4, 5, 6, 7, 8, 9 and 10 are invisible to the view point V.
In this problem, you can assume there is at most 10 surfaces in each test case.
Figure 1
Input Format
The input contains N+2 line.
Line 1 : N
Line 2 : 1 V1, V2, …, Vm
Line 3 : 2 V1, V2, …, Vk
…
Line N+1 : N V1, V2, …, Vj
Line N+2 : view point
The first line defines the number of surfaces. The second line to the N+1 line are the surfaces with their vertices. The vertex is represented by (x,y,z).
The last line is the view point which is also in the form of (x,y,z).
Output Format
The output contains all visible surfaces, sorted by numbers.
Surface 1
Surface 2
…
…
Surface k
样例输入
10
1 5.0 0.707 2.414 0.0 0.707 2.414 0.0 1.707 2.414 5.0 1.707 2.414
2 5.0 1.707 2.414 0.0 1.707 2.414 0.0 2.414 1.707 5.0 2.414 1.707
3 5.0 2.414 1.707 0.0 2.414 1.707 0.0 2.414 0.707 5.0 2.414 0.707
4 5.0 2.414 0.707 0.0 2.414 0.707 0.0 1.707 0.0 5.0 1.707 0.0
5 5.0 1.707 0.0 0.0 1.707 0.0 0.0 0.707 0.0 5.0 0.707 0.0
6 5.0 0.707 0.0 0.0 0.707 0.0 0.0 0.0 0.707 5.0 0.0 0.707
7 5.0 0.0 0.707 0.0 0.0 0.707 0.0 0.0 1.707 5.0 0.0 1.707
8 5.0 0.0 1.707 0.0 0.0 1.707 0.0 0.707 2.414 5.0 0.707 2.414
9 0.0 0.707 2.414 0.0 1.707 2.414 0.0 2.414 1.707 0.0 2.414 0.707 0.0 1.707 0.0 0.0 0.707 0.0 0.0 0.0 0.707 0.0 0.0 1.707
10 5.0 0.707 2.414 5.0 1.707 2.414 5.0 2.414 1.707 5.0 2.414 0.707 5.0 1.707 0.0 5.0 0.707 0.0 5.0 0.0 0.707 5.0 0.0 1.707
2.0 3.0 4.0
样例输出
1
2
3