#include<iostream>
#include<queue>
using namespace std;
int main() {
	int n; cin >> n;
	int t = 0;
	for (int i = 0; i < 6; i++) {
		int x; cin >> x;
		t += x;
	}
	priority_queue<pair<int, int>, vector<pair<int, int>>>pp;
	vector<priority_queue<int>>vp(n);
	for (int i = 0; i < n; i++) {
		int tt = 0;
		int x = 0;
		for (int j = 0; j < 6; j++) {
			cin >> x;
			tt += x;
			vp[i].push(x);
		}
		pp.push({ tt , i });
	}
	int cnt = 0;
	while (t <= pp.top().first) {
		t += 100;
		int tt = pp.top().first;
		int id = pp.top().second;
		tt -= vp[id].top();
		vp[id].pop();
		pp.pop();
		pp.push({ tt,id });
		cnt++;
	}
	while(!pp.empty()){cout<<pp.top().first<<endl;pp.pop();}
	cout << cnt;
}

I2luY2x1ZGU8aW9zdHJlYW0+CiNpbmNsdWRlPHF1ZXVlPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwppbnQgbWFpbigpIHsKCWludCBuOyBjaW4gPj4gbjsKCWludCB0ID0gMDsKCWZvciAoaW50IGkgPSAwOyBpIDwgNjsgaSsrKSB7CgkJaW50IHg7IGNpbiA+PiB4OwoJCXQgKz0geDsKCX0KCXByaW9yaXR5X3F1ZXVlPHBhaXI8aW50LCBpbnQ+LCB2ZWN0b3I8cGFpcjxpbnQsIGludD4+PnBwOwoJdmVjdG9yPHByaW9yaXR5X3F1ZXVlPGludD4+dnAobik7Cglmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKykgewoJCWludCB0dCA9IDA7CgkJaW50IHggPSAwOwoJCWZvciAoaW50IGogPSAwOyBqIDwgNjsgaisrKSB7CgkJCWNpbiA+PiB4OwoJCQl0dCArPSB4OwoJCQl2cFtpXS5wdXNoKHgpOwoJCX0KCQlwcC5wdXNoKHsgdHQgLCBpIH0pOwoJfQoJaW50IGNudCA9IDA7Cgl3aGlsZSAodCA8PSBwcC50b3AoKS5maXJzdCkgewoJCXQgKz0gMTAwOwoJCWludCB0dCA9IHBwLnRvcCgpLmZpcnN0OwoJCWludCBpZCA9IHBwLnRvcCgpLnNlY29uZDsKCQl0dCAtPSB2cFtpZF0udG9wKCk7CgkJdnBbaWRdLnBvcCgpOwoJCXBwLnBvcCgpOwoJCXBwLnB1c2goeyB0dCxpZCB9KTsKCQljbnQrKzsKCX0KCXdoaWxlKCFwcC5lbXB0eSgpKXtjb3V0PDxwcC50b3AoKS5maXJzdDw8ZW5kbDtwcC5wb3AoKTt9Cgljb3V0IDw8IGNudDsKfQ==

NAoxMTAwIDAgMCAwIDAgMAoxMjAwIDQwMCAxMDAgMCAwIDAKMTEwMCA0MDAgMTAwIDAgMCAwCjEwMDAgMzAwIDEwMCAwIDAgMAo5MDAgIDQwMCAyMDAgMCAwIDA=

4
1100 0 0 0 0 0
1200 400 100 0 0 0
1100 400 100 0 0 0
1000 300 100 0 0 0
900  400 200 0 0 0