// NOTE: it is recommended to use this even if you don't understand the following code.

#include <stdio.h>
#include <stdlib.h>
#include <assert.h>

// constraints
#define MAXN 10000
#define MAXM 50000
#define MAXK 100000

// input data
int N, M, K;
int A[MAXM], B[MAXM];
int* H[MAXK];

int main() {
//  uncomment the following lines if you want to read/write from files
//  freopen("input.txt", "r", stdin);
//  freopen("output.txt", "w", stdout);

    assert(1 == scanf("%d", &N));
    for(int i = 0; i < N; i++) {
        assert(2 == scanf("%d%d", &A[i], &B[i]));
    }
    
    for (int i = 0; i < K; i++) {
        int L;
        assert(1 == scanf("%d", &L));
        H[i] = malloc(L * sizeof(int));
        for (int j = 0; j < L; j++) {
            assert(1 == scanf("%d", &H[i][j]));
        }
    }


    // insert your code here
    

    printf("%d\n", 42); // print the result

    return 0;
}
