#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=n;i<N;i++)
#define p(S) cout<<S<<endl
#define PB push_back
using namespace std;


int main(){
	int n;
	map<pair<int,int>,int> mp;
	mp[{0,1}]=mp[{1,2}]=mp[{2,3}]=mp[{3,0}]=1;//clock-wise
	while(cin>>n,n){
		int m;
		int nextx,nexty,nowx,nowy,nextm,nowm=5;
		vector<int> d[51],muki[51],rmuki;
		int mu[51];
		cin>>m;
		cin>>nowx>>nowy;
		REP(i,0,m-1){
			cin>>nextx>>nexty;
			if(nextx-nowx>0)		mu[i]=0;//right
			else if(nexty-nowy<0)	mu[i]=1;//down
			else if(nextx-nowx<0)	mu[i]=2;//left;
			else if(nexty-nowy>0)	mu[i]=3;//up

			d[0].PB(abs(nextx-nowx+nexty-nowy));
			if(i) muki[0].PB(mp[{mu[i-1],mu[i]}]);
			nowx=nextx;
			nowy=nexty;
		}
		for(int i=m-2;i>0;i--){
			rmuki.PB(mp[{mu[i],mu[i-1]}]);
		}
		REP(j,1,n+1){
			cin>>m;
			cin>>nowx>>nowy;
			REP(i,0,m-1){
				cin>>nextx>>nexty;

				if(nextx-nowx>0)		nextm=0;//right
				else if(nexty-nowy<0)	nextm=1;//down
				else if(nextx-nowx<0)	nextm=2;//left;
				else if(nexty-nowy>0)	nextm=3;//up

				d[j].PB(abs(nextx-nowx+nexty-nowy));
				if(i) muki[j].PB(mp[{nowm,nextm}]);

				nowm=nextm;
				nowx=nextx;
				nowy=nexty;

			}
		}
		REP(i,1,n+1){
			if(d[0]==d[i]&&muki[0]==muki[i]){
				p(i);
				continue;
			}

			if(rmuki==muki[i]){
				bool flag=true;
				REP(j,0,m-1){
					if(d[0][j]!=d[i][m-j-2]){
						flag=false;
						break;
					}
				}
				if(flag) p(i);
			}

		}

		p("+++++");
	}


	return 0;
}
### Prompt

Please create a solution in CPP to the following problem:

Multiple polygonal lines are given on the xy-plane. Given a list of polygonal lines and a template, you must find out polygonal lines which have the same shape as the template.

A polygonal line consists of several line segments parallel to x-axis or y-axis. It is defined by a list of xy-coordinates of vertices from the start-point to the end-point in order, and always turns 90 degrees at each vertex. A single polygonal line does not pass the same point twice. Two polygonal lines have the same shape when they fully overlap each other only with rotation and translation within xy-plane (i.e. without magnification or a flip). The vertices given in reverse order from the start-point to the end-point is the same as that given in order.

Figure 1 shows examples of polygonal lines. In this figure, polygonal lines A and B have the same shape.

Write a program that answers polygonal lines which have the same shape as the template.

<image>
---
Figure 1: Polygonal lines



Input

The input consists of multiple datasets. The end of the input is indicated by a line which contains a zero.

A dataset is given as follows.

> n
>  Polygonal line0
>  Polygonal line1
>  Polygonal line2
>  ...
>  Polygonal linen

n is the number of polygonal lines for the object of search on xy-plane. n is an integer, and 1 <= n <= 50. Polygonal line0 indicates the template.

A polygonal line is given as follows.

> m
>  x1 y1
>  x2 y2
>  ...
>  xm ym
>

m is the number of the vertices of a polygonal line (3 <= m <= 10). xi and yi, separated by a space, are the x- and y-coordinates of a vertex, respectively (-10000 < xi < 10000, -10000 <yi < 10000).

Output

For each dataset in the input, your program should report numbers assigned to the polygonal lines that have the same shape as the template, in ascending order. Each number must be written in a separate line without any other characters such as leading or trailing spaces.

Five continuous "+"s must be placed in a line at the end of each dataset.

Example

Input

5
5
0 0
2 0
2 1
4 1
4 0
5
0 0
0 2
-1 2
-1 4
0 4
5
0 0
0 1
-2 1
-2 2
0 2
5
0 0
0 -1
2 -1
2 0
4 0
5
0 0
2 0
2 -1
4 -1
4 0
5
0 0
2 0
2 1
4 1
4 0
4
4
-60 -75
-60 -78
-42 -78
-42 -6
4
10 3
10 7
-4 7
-4 40
4
-74 66
-74 63
-92 63
-92 135
4
-12 22
-12 25
-30 25
-30 -47
4
12 -22
12 -25
30 -25
30 47
3
5
-8 5
-8 2
0 2
0 4
8 4
5
-3 -1
0 -1
0 7
-2 7
-2 16
5
-1 6
-1 3
7 3
7 5
16 5
5
0 1
0 -2
8 -2
8 0
17 0
0


Output

1
3
5
+++++
3
4
+++++
+++++

### Response

```cpp
#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=n;i<N;i++)
#define p(S) cout<<S<<endl
#define PB push_back
using namespace std;


int main(){
	int n;
	map<pair<int,int>,int> mp;
	mp[{0,1}]=mp[{1,2}]=mp[{2,3}]=mp[{3,0}]=1;//clock-wise
	while(cin>>n,n){
		int m;
		int nextx,nexty,nowx,nowy,nextm,nowm=5;
		vector<int> d[51],muki[51],rmuki;
		int mu[51];
		cin>>m;
		cin>>nowx>>nowy;
		REP(i,0,m-1){
			cin>>nextx>>nexty;
			if(nextx-nowx>0)		mu[i]=0;//right
			else if(nexty-nowy<0)	mu[i]=1;//down
			else if(nextx-nowx<0)	mu[i]=2;//left;
			else if(nexty-nowy>0)	mu[i]=3;//up

			d[0].PB(abs(nextx-nowx+nexty-nowy));
			if(i) muki[0].PB(mp[{mu[i-1],mu[i]}]);
			nowx=nextx;
			nowy=nexty;
		}
		for(int i=m-2;i>0;i--){
			rmuki.PB(mp[{mu[i],mu[i-1]}]);
		}
		REP(j,1,n+1){
			cin>>m;
			cin>>nowx>>nowy;
			REP(i,0,m-1){
				cin>>nextx>>nexty;

				if(nextx-nowx>0)		nextm=0;//right
				else if(nexty-nowy<0)	nextm=1;//down
				else if(nextx-nowx<0)	nextm=2;//left;
				else if(nexty-nowy>0)	nextm=3;//up

				d[j].PB(abs(nextx-nowx+nexty-nowy));
				if(i) muki[j].PB(mp[{nowm,nextm}]);

				nowm=nextm;
				nowx=nextx;
				nowy=nexty;

			}
		}
		REP(i,1,n+1){
			if(d[0]==d[i]&&muki[0]==muki[i]){
				p(i);
				continue;
			}

			if(rmuki==muki[i]){
				bool flag=true;
				REP(j,0,m-1){
					if(d[0][j]!=d[i][m-j-2]){
						flag=false;
						break;
					}
				}
				if(flag) p(i);
			}

		}

		p("+++++");
	}


	return 0;
}
```