#include <queue>

#include <cstdio>
using namespace std;

int N, K;
priority_queue < int, vector < int >, greater < int > > H;

int main() {
	freopen("interclasari.in", "r", stdin);
	freopen("interclasari.out", "w", stdout);
	
	scanf("%d", &K);
	for(int i = 1; i <= K; ++i) {
		int n;
		
		scanf("%d", &n);
		for(int j = 1; j <= n; ++j) {
			int x;
			
			scanf("%d", &x);
			
			H.push(x);
		}

		N += n;
	}

	printf("%d\n", N);
	while(!H.empty()) {
		printf("%d ", H.top());
		
		H.pop();
	}

	return 0;
}