#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;

const long long MAXN = 3010;
const long long INF = 1e10;
long long n, k, p[MAXN], w[MAXN][MAXN];
long long maxw[11][MAXN], eid[11];
priority_queue<pair<long long, long long>> pq[11];
long long ans[11], maxx[11][11][MAXN], Ans;
long long maxx2[11][11][MAXN], sum[11][MAXN];

void dfs(long long N, long long K) {
	if (N == n + 1) {
		for (long long i = 1; i <= 10; i++) {
			if (K + i > k) {
				long long cnt = 0;
				for (long long u = 1; u <= 10; u++)
					cnt += sum[u][ans[u]];
				cnt += maxx[i][k - K][ans[i]];
				cnt += sum[i][ans[i] + 1] - sum[i][ans[i]];
				Ans = max(Ans, cnt);
				cnt = 0;
				for (long long u = 1; u <= 10; u++)
					cnt += sum[u][ans[u]];
				cnt += maxx2[i][k - K][ans[i] + 1];
				Ans = max(Ans, cnt);
			} 
		}
		long long cnt = 0;
		for (long long u = 1; u <= 10; u++)
			cnt += sum[u][ans[u]]; 
		Ans = max(Ans, cnt);
		return;
	}
	for (long long i = eid[N]; i >= 0; i--) {
		if (K + N * i <= k) {
			ans[N] = i;
			dfs(N + 1, K + N * i);
			ans[N] = 0;
		}	
	}
}

int main() {
	scanf("%lld %lld", &n, &k);
	for (long long i = 1; i <= n; i++) {
		scanf("%lld", &p[i]);
		for (long long j = 1; j <= p[i]; j++) {
			scanf("%lld", &w[i][j]);
		}
		pq[p[i]].push(make_pair(w[i][p[i]], i));
	}
	for (long long u = 1; u <= 10; u++) {
		while (!pq[u].empty()) {
			eid[u]++;
			maxw[u][eid[u]] = pq[u].top().second;
			pq[u].pop();
		}
	}
	for (long long u = 1; u <= 10; u++) {
		for (long long i = 1; i <= eid[u]; i++)
			sum[u][i] = sum[u][i - 1] + w[maxw[u][i]][u];
	}
	for (long long u = 1; u <= 10; u++) {
		for (long long y = 1; y < u; y++) {
			maxx[u][y][0] = 0;
			for (long long i = 1; i <= eid[u]; i++)
				maxx[u][y][i] = max(maxx[u][y][i - 1], w[maxw[u][i]][y] - w[maxw[u][i]][u]);
		}
		for (long long y = 1; y < u; y++) {
			maxx2[u][eid[u] + 1][0] = 0;
			for (long long i = eid[u]; i >= 1; i--)
				maxx2[u][y][i] = max(maxx[u][y][i + 1], w[maxw[u][i]][y]);
		}
	}
//	for (long long u = 1; u <= 10; u++) {
//		cout << u << endl;
//		for (long long y = 1; y < u; y++) {
//			for (long long i = 1; i <= eid[u]; i++)
//				cout << maxx[u][y][i] << " ";
//			cout << endl;
//			for (long long i = eid[u]; i >= 1; i--)
//				cout << maxx[u][y][i] << " ";
//			cout << endl;
//		}
//	}
	dfs(1, 0);
	printf("%lld\n", Ans);
	return 0;
}