ios::sync_with_stdio(0);

cin.tie(0);

cout.tie(0);

LL d, n, s, c, f;

cin >> d >> n >> s >> c >> f;

map <pair<int,int>, string> name;

map <string,int> traffic;

map <string, pair<int,int>> iname;

map <pair<int,int>, LL> len;

vector<int> beg[n];

vector<int> end[n];

for(int i = 0; i < s; i++) {

int b, e; cin >> b >> e;

cin >> name[{b,e}];

cin >> len[{b,e}];

iname[name[{b,e}]] = {b,e};

beg[e].push_back(b);

end[b].push_back(e);

}

vector <int> path[n];

vector <int> pathlen;

for(int i = 0; i < c; i++) {

int p;

cin >> p;

pathlen.push_back(p);

for(int j = 0; j < p; j++) {

string sname; cin >> sname;

traffic[sname]++;

if(!j) path[p].push_back(iname[sname].fi);

path[p].push_back(iname[sname].se);

}

}

// solution d

cout << n << endl;

for(int i = 0; i < n; i++) {

cout << i << "\n";

vector<pair<int,string>> maxTraffic;

for(auto b: beg[i])

maxTraffic.push_back(make_pair(traffic[name[{b, i}]],name[{b, i}]));

sort(maxTraffic.begin(), maxTraffic.end());

cout<<min((size_t)1000,maxTraffic.size())<<"\n";

for(int i1=0;i1<min((size_t)1000,maxTraffic.size());i1++)

cout<<maxTraffic[maxTraffic.size()-1-i1].second<<" 1\n";

}

// solution a

// cout << "3\n0\n1\nrue-de-londres 1\n1\n2\n";

// cout << "rue-d-athenes 1\nrue-d-amsterdam 1\n2\n1\n";

// cout << "rue-de-moscou 1\n";

fio();

solve();

return 0;

}