#include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <cstdio>
#include <climits>
#include <complex>
#include <cstdint>
#include <tuple>

#define M_PI       3.14159265358979323846

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
inline int readInt() { int x; scanf("%d", &x); return x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;

//container util

//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
struct Edge {
    int to, cost;
    Edge(int to, int cost): to(to), cost(cost) {}
};

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<Edge>> AdjList;
AdjList graph;

const int INF = 100000000;



bool check(int idx, vector<pair<int, int>> &curr, vector<pair<int, int>> vp){


    int n = curr.size();

    for(int j=0; j<4; ++j) {
        for(int k=0; k<2; ++k) {
            for (int i = 0; i < n - 1; ++i) {
                int cx = curr[i].first, cy = curr[i].second;
                int cnx = curr[i + 1].first, cny = curr[i + 1].second;

                int vx = vp[i].first, vy = vp[i].second;
                int vnx = vp[i + 1].first, vny = vp[i + 1].second;

                if (cnx - cx == vnx - vx && cny - cy == vny - vy) {
                    if (i == n - 2) return true;
                }else break;
            }
            reverse(all(vp));
        }

        for(int i=0; i<vp.size(); ++i){
            if(idx == 0){
                //cout << vp[i].first << " " << vp[i].second << endl;
            }
            int t = vp[i].first;
            vp[i].first = -vp[i].second;
            vp[i].second = t;

        }
    }
    return false;
}

int main() {
    //cout << fixed << setprecision(15);

    int n;
    while(cin >> n, n){
        vector<pair<int, int>> curr;

        int m = readInt();
        for(int i=0; i<m; ++i){
            int y, x; cin >> x >> y;
            curr.push_back({x, y});

        }

        vector<int> ans;
        for(int i=0; i<n; ++i){
            m = readInt();
            vector<pair<int, int>> vp;
            for(int j=0; j<m; ++j){
                int x = readInt(), y = readInt();
                vp.push_back({x, y}); //cout << x << " " << y << endl;
            }

            if(check(i, curr, vp)){
                ans.push_back(i+1);
            }
        }

        for(auto e: ans) cout << e << endl;
        cout << "+++++" << endl;
    }
    return 0;
}


Measured memory_bytes: 3196