#include <iostream>
#include <vector>
#include <list>
#include <algorithm>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <sstream>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

#define rep(i, n) for(int i = 0; i < n; i ++)
#define COUNT(i, n) for(int i = 1; i <= n; i ++)
#define ITER(c) __typeof((c).begin())
#define each(c, it) for(ITER(c) it =(c).begin(); it!=(c).end(); it++)
#define ALL(c) c.begin(), c.end()
#define mp make_pair
#define pb push_back
#define MEMSET(v, h) memset((v), h, sizeof(v))
 
using namespace std; 

typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;

const int INF = 1 << 24;

pii getData(string);

int main(void){
    map<int, int> t;
    string in;
    bool isLast = false;
    set<int> res;

    while(getline(cin, in) && (in.at(0) != 13 || (isLast = true))){
        if(in.at(0) == 13){ isLast = true; continue; }
        stringstream ss;
        ss << in.substr(0, in.find(","));
        int ind; ss >> ind;

        if(isLast){
            if(t[ind]) res.insert(ind);
            else continue;
        }
        t[ind] ++;
    }
    each(res, it) cout << *it << ' ' << t[*it] << endl;

    return 0;
}