3033：Traveling Salesman

Each test case consists of a line containing c, the number of countries (4 ≤ c ≤ 6000), followed by c lines containing the integers n x₁ y₁ z₁ … x_n y_n z_n, describing (in order) the n corners of a closed polygon (3 ≤ n ≤ 20). Then follows a line with one integer m (0 < m ≤ 50), and then m lines with queries c_a c_b, where c_a and c_b are country numbers (starting with 1). No point will be on the line between two connected points, and −10⁶ ≤ x, y, z ≤ 10⁶ for all points. No two non-adjacent edges of a country share a common point. The input is terminated by a case where c = 0, which should not be processed.