Problem Statement:

You are given a list of music events, each with a specific date. The dates of these events can be changed to other available dates. Additionally, you are provided with a list of n students, where each student is attending a certain number of events. The score for a student is defined as the sum of the absolute differences between the dates of the events they are attending. Your task is to arrange the events in a way that maximizes the sum of the scores for all students.

Input:

The input consists of: 1. An integer m (1≤m≤10^3) representing the number of music events. 2. m lines, each containing an integer di​ (1≤di≤10) representing the date of the ith event. 3. Another m lines, each containing an integer k (1≤k≤5) representing the number of available dates that each event can be changed to and k integers (1≤aj≤10) each representing an available date. 5. An integer n (1≤n≤5*10^3) representing the number of students. 6. n lines, each containing an integer t (5≤t≤10), and t numbers where each number represents represents attending a music event with that index.

Output:

Output a single integer representing the maximum possible sum of scores for all students.