#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

string t[2];
string name,tt,op,n1,n2;
vector<pair<string,int>> player;
set<pair<string,int>> pc;
set<string> s[2];
map<string,int> sco[2];
int q;


int main() {
	cin>>t[0];
	rep(i,0,5) {
		cin>>name;
		player.pb(mp(name,0));
		pc.insert(mp(name,0));
		s[0].insert(name);
	}
	cin>>t[1];
	rep(i,0,5) {
		cin>>name;
		player.pb(mp(name,1));
		pc.insert(mp(name,1));
		s[1].insert(name);
	}
	cin>>q;
	rep(i,0,q) {
		cin>>tt>>tt;
		int pt=0;
		if (tt==t[1]) pt=1;
		cin>>op;
		if (op=="scored") {
			int sc;
			cin>>sc;
			for (auto name:s[pt]) sco[pt][name]+=sc;
			for (auto name:s[1-pt]) sco[1-pt][name]-=sc;
		} else {
			cin>>n1>>tt>>n2;
			assert(s[pt].count(n1));
			s[pt].erase(n1);
			s[pt].insert(n2);
			if (!pc.count(mp(n2,pt))) {
				player.pb(mp(n2,pt));
				pc.insert(mp(n2,pt));
			}
		}
	}
	for (auto [pl,tn]:player) {
		cout<<pl<<" ("<<t[tn]<<") ";
		int v=sco[tn][pl];
		if (v==0) cout<<"0\n";
		else if (v>0) cout<<"+"<<v<<"\n";
		else cout<<v<<"\n";
	}
}