#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;

// tourist set
template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << '\n'; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
// tourist set end

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; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,b) FOR(i, 0, b)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<'\n'
#define p2(s, t) cout << (s) << " " << (t) << '\n'
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << '\n'
#define p_yes() p("YES")
#define p_no() p("NO")
#define SZ(x) ((int)(x).size())
#define SORT(A) sort(ALL(A))
#define RSORT(A) sort(ALL(A), greater<ll>())
#define MP make_pair

void no(){p_no(); exit(0);}
void yes(){p_yes(); exit(0);}

const ll mod = 1e9 + 7;
const ll inf = 1e18;
const double PI = acos(-1);

typedef complex<ll> C;
#define X real()
#define Y imag()

vector<C> rotate(vector<C> A){
  ll N = A.size();
  rep(i, N){
    ll x = A[i].X;
    ll y = A[i].Y;
    A[i] = {-y, x};
  }
  return A;
}

string str_c(C c){
  stringstream ss;
  ss << '(' << c.X << ' ' << c.Y << ')';
  return ss.str();
}

// for debug
void printV(vector<C> A){
  for(auto c : A){
    cout << str_c(c) << ' ';
  }
  cout << endl;
}

bool isSameSub(vector<C> A, vector<C> B){
  // printV(A);
  // printV(B);
  ll N = A.size();
  // 始点を０に
  FOR(i, 1, N){
    A[i] -= A[0];
    B[i] -= B[0];
  }
  A[0]=0;
  B[0]=0;

  // B側を0, 90, 180, 270回転させる
  rep(r, 4){
    B = rotate(B);
    if(A==B) return true;
  }

  return false;
}

bool isSame(vector<C> A, vector<C> B){
  if(A.size()!=B.size()) return false;

  if(isSameSub(A, B)) return true;

  // reverseしたら合うかも
  reverse(ALL(B));
  if(isSameSub(A, B)) return true;

  // それでもだめならだめ
  return false;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll N; 
    
    while(cin>>N){
      if(N==0) return 0;

      vector<vector<C>> G(N+1);
      rep(i, N+1){
        ll m; cin>>m;
        rep(j, m){
          ll x, y; cin >> x >> y;
          G[i].push_back({x, y});
        }
      }

      FOR(i, 1, N+1){
        // i = 3;
        if(isSame(G[0], G[i])){
          p(i);
        }
        // return 0;
      }
      p("+++++");
    }
    
    return 0;
}


Measured memory_bytes: 3108