const int maxn = 1e5 + 7;
int B, L, D;
int VAL[maxn];
int N[maxn], T[maxn], M[maxn];
vector<int> BOOKS[maxn], LIBRARIES[maxn];

void read(){
    cin >> B >> L >> D;
    for (int i = 0; i < B; i++)
        cin >> VAL[i];
    for (int i = 0; i < L; i++){
        cin >> N[i] >> T[i] >> M[i];
        BOOKS[i].resize(N[i]);
        for (int& x : BOOKS[i]){
            cin >> x;
            LIBRARIES[x].push_back(i);
        }
    }
}

int START[maxn];
vector<int> RESULT[maxn];

void print(){
    vector<int> signuped;
    for (int i = 0; i < L; i++){
        if (START[i] != -1)
            signuped.push_back(i);
    }
    cout << signuped.size() << endl;
    sort(signuped.begin(), signuped.end(), [&](int i, int j){
        return START[i] < START[j];
    });
    for (int i : signuped){
        cout << i << ' ' << RESULT[i].size() << endl;
        print(RESULT[i]);
    }
}