#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;
const int N = 110;
int a[N], b[N][N];         //出现的次数、多少篇文章出现过
int t, n, m;

int main()
{
    cin >> t >> n;
    for(int i = 1; i <= t; i ++)
    {
        cin >> m;
        while(m --)
        {
            int x;
            cin >> x;
            b[i][x] ++;     //第i篇文章计数
            a[x] ++;        //总计数
        }
    }

    //输出
    for(int i = 1; i <= n; i ++)
    {
        int cnt = 0;
        for(int j = 1; j <= t; j ++)        //查看t篇文章中,单词i出现的次数
        {
            if(b[j][i] != 0) cnt ++;
        }
        cout << cnt << " " << a[i] << endl;
    }

    return 0;
}