#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <functional>
#include <numeric>
#include <string>
#include <vector>
#include <deque>
#include <math.h>
using namespace std;
int a[7] = { 0,0,0,0,0,0,0 };
int main()
{
int n;
cin >> n;
vector<int>bset_numbers;
int val;
for (int i = 0; i < 7; i++)
{
cin >> val;
bset_numbers.push_back(val);
}
vector<vector<int>>my_numbers;
vector<int>num;
num.clear();
for (int i = 0; i < n ; i++)
{
num.clear();
for (int j = 0; j < 7; j++)
{
cin >> val;
num.push_back(val);
}
my_numbers.push_back(num);
}
for (auto it_first = my_numbers.begin(); it_first != my_numbers.end(); it_first++)
{
int count = 0;
for (auto it_second = (*it_first).begin(); it_second != (*it_first).end(); it_second++)
{
for (auto it = bset_numbers.begin(); it != bset_numbers.end(); it++)
{
if (*it == *it_second)
{
count++;
}
}
}
if(count>0)
a[count-1] = a[count-1]++;
}
for (int i = 6; i >= 0; i--)
{
cout << a[i] << " ";
}
cout << endl;
return 0;
}