#include <iostream>
#include <vector>
#define ll long long
using namespace std;

ll n, m, word_num, word;

struct my_word
{
	ll n;  // 出现次数
	bool f; // 是否在当前轮次已经被统计过
};

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	cin >> n >> m;
	vector<ll> y(m + 1, 0);
	vector<my_word>x(m + 1, { 0,0 });

	for (size_t i = 0; i < n; i++)
	{
		cin >> word_num;
		for (size_t j = 0; j < word_num; j++)
		{
			cin >> word;

			// 统计本篇文章是否包含该单词
			if (x[word].f == 0)
			{
				x[word].n++;
				x[word].f = 1;
			}

			// 统计总计出现次数
			y[word]++;
		}

		for (auto& it : x)it.f = 0;
	}

	for (size_t i = 1; i <= m; i++)
	{
		cout << x[i].n << " " << y[i] << endl;
	}

	return 0;
}