#include <bits/stdc++.h>
using namespace std;
#define int long long
using ll=long long;
using vi=vector<int>;
using vl=vector<long long>;
using pii=pair<int,int>;
using pll=pair<long long,long long>;
#define ITR(i,c) for(auto i=begin(c);i!=end(c);++i)
#define FORE(x,c) for(auto &x:c)
#define REPF(i,a,n) for(int i=a,i##_len=(int)(n);i<i##_len;++i)
#define REP(i,n) REPF(i,0,n)
#define REPR(i,n) for(int i=(int)(n);i>=0;--i)
#define REPW(i,n) for(i=0;i<(int)(n);++i)
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)   // c++14
#define SZ(c) ((int)c.size())
#define EXIST(c,x) (c.find(x)!=end(c))
#define OUTOFRANGE(y,x,h,w) (y<0||x<0||y>=h||x>=w)
#define dump(...)
const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0};
#define INF (1001001001)
#define INFLL (1001001001001001001ll)
template<class T> ostream& operator << (ostream &os,const vector<T> &v) {
    ITR(i,v) os << *i << (i==end(v)-1 ? "" : " "); return os; }
template<class T> istream& operator >> (istream &is,vector<T> &v) {
    ITR(i,v) is >> * i; return is; }
template<class T> istream& operator >> (istream &is, pair<T,T> &p) {
        is >> p.first >> p.second; return is; }
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return 1;}return 0;}
//------------------------------------------------------------------------------
struct before_main_function {
    before_main_function() {
        #ifdef int
            #undef INF
            #define INF INFLL
            #define stoi stoll
        #endif
        cin.tie(0);ios::sync_with_stdio(false);
        cout<<setprecision(15)<<fixed;
    }
} before_main_function;
//------------------------------------------------------------------------------

using P=pii;
struct edge{
    int len;
    int dir;
};
edge get_edge(P a, P b) {
    edge ret;
    ret.len=abs(a.first-b.first)+abs(a.second-b.second);
    REP(d,4) {
        P o=a;
        o.first+=DX[d]*ret.len;
        o.second+=DY[d]*ret.len;
        if(o==b) {
            ret.dir=d;
            break;
        }
    }
    return ret;
}
pair<vector<edge>,vector<edge>> create_lines() {
    int m;
    cin>>m;
    vector<P> p;
    vector<edge> e,re;
    REP(j,m) {
        int a,b;
        cin>>a>>b;
        p.push_back({a,b});
    }
    REPF(j,1,m) {
        e.push_back(get_edge(p[j-1],p[j]));
        re.push_back(get_edge(p[m-j],p[m-j-1]));
    }
    int r=0,s=0;
    while(e[0].dir!=0) {
        e[0].dir++;
        r++;
        e[0].dir%=4;
    }
    REPF(j,1,SZ(e)) {
        REP(k,r) {
            e[j].dir++;
            e[j].dir%=4;
        }
    }
    while(re[0].dir!=0) {
        re[0].dir++;
        s++;
        re[0].dir%=4;
    }
    REPF(j,1,SZ(re)) {
        REP(k,s) {
            re[j].dir++;
            re[j].dir%=4;
        }
    }
    return {e,re};
}
bool compare_lines(vector<edge> &a,vector<edge> &b) {
    if(SZ(a)!=SZ(b)) return false;
    REP(i,SZ(a)) {
        if(a[i].dir!=b[i].dir || a[i].len!=b[i].len) return false;
    }
    return true;
}
void solve(int n) {
    auto base=create_lines();
    REP(i,n) {
        auto l=create_lines();
        if(compare_lines(base.first,l.first) || compare_lines(base.first,l.second)) {
            cout<<i+1<<endl;
        }
    }
}
signed main() {
    while(1) {
        int n;
        cin>>n;
        if(!n) break;
        solve(n);
        cout<<"+++++"<<endl;
    }
    return 0;
}

Measured memory_bytes: 3056