#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include<set>
using namespace std;

map<string,int> reportCount;
map<string,set<string>> reportLog;

vector<int> solution(vector<string> id_list, vector<string> report, int k) {
    vector<int> answer;
    
    for(string s : report){
        int blank = s.find(' ');
        string from = s.substr(0,blank);
        string to = s.substr(blank);
        
        if(reportLog[from].find(to) == reportLog[from].end()){
            reportCount[to]++;
            reportLog[from].insert(to);
        }
    }
    
    for(string s : id_list)
    {
        int result=0;
        
        for(string str : reportLog[s])
        {
            if(reportCount[str]>=k)
            {
                result++;
            }
        }
        answer.push_back(result);
    }
    
    return answer;
}