#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
const int maxn = 4e4 + 10;
struct stu {
    int id, ge, gi, tot, choice[5];
    bool operator<(const stu&x)const
    {
        return tot == x.tot ? ge > x.ge: tot > x.tot;
    }
}a[maxn];
struct sch {
    int quota;
    vector<int>admit;
    stu last;
}school[110];
int n, m, k;
int main()
{
    scanf("%d%d%d", &n, &m, &k);
    for (int i = 0; i < m; i++)scanf("%d", &school[i].quota);
    for (int i = 0; i < n; i++)
    {
        a[i].id = i;
        scanf("%d%d", &a[i].ge, &a[i].gi);
        a[i].tot = a[i].ge + a[i].gi;
        for (int j = 0; j < k; j++)scanf("%d", &a[i].choice[j]);
    }
    sort(a, a + n);
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < k; j++)
        {
            int target_school = a[i].choice[j];
            if (school[target_school].quota)
            {
                school[target_school].admit.push_back(a[i].id);
                school[target_school].quota--;
                if (school[target_school].quota == 0)
                    school[target_school].last = a[i];
                break;
            }
            else
            {
                stu last = school[target_school].last;
                if (a[i].ge == last.ge&&a[i].tot == last.tot)
                {
                    school[target_school].admit.push_back(a[i].id);
                    break;
                }
            }
        }
    }
    for (int i = 0; i < m; i++)
    {
        sort(school[i].admit.begin(), school[i].admit.end());
        for (int j = 0; j < school[i].admit.size(); j++)
        {
            printf("%d", school[i].admit[j]);
            if (j != school[i].admit.size() - 1)printf(" ");
        }
        printf("\n");
    }
    return 0;
}