#include <bits/stdc++.h>
using namespace std;

typedef ostringstream OSS; typedef istringstream ISS;
typedef long long LL;
typedef pair<int, int> PII;  typedef pair<LL, LL> PLL;
typedef vector<int>    VI;   typedef vector<VI>   VVI;   typedef vector<VVI>   VVVI;
typedef vector<LL>     VLL;  typedef vector<VLL>  VVLL;  typedef vector<VVLL>  VVVLL;
typedef vector<double> VD;   typedef vector<VD>   VVD;   typedef vector<VVD>   VVVD;
typedef vector<string> VS;   typedef vector<VS>   VVS;   typedef vector<VVS>   VVVS;
typedef vector<bool>   VB;   typedef vector<VB>   VVB;   typedef vector<VVB>   VVVB;
typedef vector<PII>    VPII; typedef vector<VPII> VVPII; typedef vector<VVPII> VVVPII;
typedef vector<PLL>    VPLL; typedef vector<VPLL> VVPLL; typedef vector<VVPLL> VVVPLL;

typedef unsigned int  UI;
typedef vector<UI>    VUI;
typedef vector<VUI>   VVUI;

#define fst first
#define snd second
// #define Y first
// #define X second
#define MP make_pair
#define PB push_back
#define EB emplace_back 
#define ALL(x)  (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define RANGEBOX(x,y,maxX,maxY) (0 <= (x) && 0 <= (y) && (x) < (maxX) && (y) < (maxY))
#define RANGE(x, l, r) ((l) <= (x) && (x) <= (r))
#define rep(i, N)  for (int i = 0; i < (int)(N); i++)
#define rrep(i, N) for (int i = N - 1; i >= 0; i--)
#define REP(i, init, N)  for (int i = (init); i < (int)(N); i++)
#define RREP(i, N, last) for (int i = (init - 1); i >= last; i--)
#define MAXUD(orig, target) orig = max(orig, target)
#define MINUD(orig, target) orig = min(orig, target)
#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

template < typename T > inline T fromString(const string &s) { T res; ISS iss(s); iss >> res; return res; };
template < typename T > inline string toString(const T &a)   { OSS oss; oss << a; return oss.str(); };

template<typename T=int> inline void dump(vector<T> vs, bool ent=false) { rep(i, vs.size()) cout << vs[i] << (i+1==vs.size() ? '\n' : ' '); if (ent) cout << endl; }
template<typename T = int> inline void dump(vector<vector<T>> vs, bool ent = false) { rep(i, vs.size()) dump<T>(vs[i]); if (ent) cout << endl; }

const int    INF  = 0x3f3f3f3f;
const LL     INFL = 0x3f3f3f3f3f3f3f3fLL;
const double DINF = 0x3f3f3f3f;
const int    DX[] = {1,  0, -1, 0};
const int    DY[] = {0, -1,  0, 1};
const double EPS  = 1e-12;
// const double PI   = acos(-1.0);
// lambda: [](T1 x)->T2{return y;}
// simple lambda: [](T x){return x;}

int ccw(PII a, PII b) {
    if (a.snd > b.snd) return 0;
    if (a.fst < b.fst) return 1;
    if (a.snd < b.snd) return 2;
    return 3;
}

int dist(PII a, PII b) {
    return max( abs(a.fst - b.fst), abs(a.snd - b.snd) );
}

bool check(VPII &line1, VPII &line2, int m) {
    int diff = (ccw(line2[0], line2[1]) - ccw(line1[0], line1[1]) + 4) % 4;

    rep(i, m - 1) {
        int d1 = dist(line1[i], line1[i + 1]);
        int d2 = dist(line2[i], line2[i + 1]);
        if (d1 != d2) return false;

        int c1 = ccw(line1[i], line1[i + 1]);
        int c2 = ccw(line2[i], line2[i + 1]);
        if ((c2 - c1 + 4) % 4 != diff) {
            return false;
        }
    }

    return true;
}

void solve(int n) {
    VVPII lines(n + 1);
    VI ms(n + 1);
    rep(i, n + 1) {
        cin >> ms[i];
        lines[i].resize(ms[i]);
        rep(j, ms[i]) {
            cin >> lines[i][j].fst >> lines[i][j].snd;
        }
    }

    REP(i, 1, n + 1) {
        if (ms[0] != ms[i]) continue;
        if (check(lines[0], lines[i], ms[0])) cout << i << endl;
        else {
            reverse(ALL(lines[i]));
            if (check(lines[0], lines[i], ms[0])) cout << i << endl;
        }
    }

    cout << "+++++" << endl;
}

int main(void) {
    int n;
    while (cin >> n, n) solve(n);

    return 0;
}

Measured memory_bytes: 3016