#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
int n, m, w, path[110];
struct node{
int data;
vector<int> child;
}Node[110];
bool cmp(int a, int b){
return Node[a].data > Node[b].data;
}
void DFS(int index, int numnode, int sum){
if(sum > w) return;
if(sum == w){
if(Node[index].child.size() != 0) return;
for(int i = 0; i < numnode; i++){
printf("%d", Node[path[i]].data);
if(i < numnode - 1) printf(" ");
else printf("\n");
}
return;
}
for(int i = 0; i < Node[index].child.size(); i++){
int child = Node[index].child[i];
path[numnode] = child;
DFS(child, numnode + 1, sum + Node[child].data);
}
}
int main(){
scanf("%d %d %d", &n, &m, &w);
for(int i = 0; i < n; i++){
scanf("%d", &Node[i].data);
}
for(int i = 0; i < m; i++){
int id, k, child;
scanf("%d %d", &id, &k);
for(int j = 0; j < k; j++){
scanf("%d", &child);
Node[id].child.push_back(child);
}
sort(Node[id].child.begin(), Node[id].child.end(), cmp);
}
path[0] = 0;
DFS(0, 1, Node[0].data);
return 0;
}