//常规题,深度优先,注意树的节点的顺序,输出结果记得排序
#include<iostream>
#include<fstream>#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<math.h>
#include<string>
using namespace std;
int N,M,S;
int *weight;
//#define fin cin
int data[110][110];
vector<int> ans[110];
int NUM=0;
void df(int from ,int sumweight,queue<int> indata)
{
bool leaf=true;
indata.push(weight[from]);
if(sumweight>S) //剪枝
return;
if(sumweight==S)
{
for(int i=1;i<N;i++)
{
if(data[from][i]!=-1)
{
leaf=false; //判断是否是叶子结点
return;
}
}
/*cout<<indata.front();
indata.pop();
while(indata.size())
{
cout<<" "<<indata.front();
indata.pop();
}
cout<<endl;*/
int i=0;
while(indata.size())
{
ans[NUM].push_back(indata.front());
indata.pop();
}
ans[NUM][i]=-1;
NUM++;
return;
}
for(int i=1;i<N;i++)
{
if(data[from][i]!=-1)
{
df(i,sumweight+data[from][i],indata);
}
}
}
bool cmp(vector<int> a,vector<int> b)
{
int lena=a.size();
int lenb=b.size();
int i=0,j=0;
while(1)
{
if(a[i]>b[j])
return true;
else if(a[i]<b[j])
return false;
else
{
i++;
j++;
if(i==lena)
return false;
if(j==lenb)
return true;
}
}
}
int main()
{
/*ifstream fin("d:\in.txt" );
if (! fin.is_open())
{
cout << "Error opening file";
system("pause");
exit (1);
}*/
cin>>N>>M>>S;
weight =new int[N];
for(int i=0;i<N;i++)
{
cin>>weight[i];
}
for(int i=0;i<N;i++)
{
for(int j=0;j<N;j++)
{
data[i][j]=-1; //初始化为-1;
}
}
int xuhao=0;
data[0][0]=weight[xuhao];
for(int i=0;i<M;i++)
{
int index=0,num=0;
cin>>index>>num;
for(int j=0;j<num;j++)
{
int index2=0;
cin>>index2;
data[index][index2]=weight[index2]; //表明联通
}
}
queue<int> indata;
//indata.push(weight[0]);
df(0 ,weight[0],indata);
sort(ans,ans+NUM,cmp);
for(int i=0;i<NUM;i++) //ans[0],ans[1],ans[2],ans[3]
{
int len=ans[i].size();
cout<<weight[0];
for(int j=1;j<len;j++)
cout<<" "<<ans[i][j];
cout<<endl;
}
system("PAUSE");
return 0;
}