#include <stdio.h>

#define N 4
#define M 5
int p[N][M];	/* p[y][x] */
int c[M];	/* Soucty sloupecku */
int ay, by;
int max=-100000, maxax, maxay, maxbx, maxby, maxobsah;

void
na_primce(void)
{
	int ax=0, bx, h=0;
	for (bx=0; bx<M; bx++) {
		int obsah = (bx-ax)*(by-ay);
		h+=c[bx];
		if ((h > max) || ((h == max) && (obsah<maxobsah))) {
			maxax=ax; maxay=ay; maxbx=bx; maxby=by; max=h;
			maxobsah = obsah;
		}
		if (h<=0)
			h=0, ax=bx+1;
	}
}

int
main(void)
{
	int i;
	for (i=0; i<N*M; i++)
		scanf("%d ", &p[0][i]);

	for (ay=0; ay<N; ay++) {
		for (i=0; i<M; i++) c[i] = 0;
		for (by=ay; by<N; by++) {
			for (i=0; i<M; i++) c[i] += p[by][i];
			na_primce();
		}
	}
	printf("Hledana podmatice ma levy horni roh v %d. sloupci, %d. radku a pravy dolni v %d. sloupci a %d. radku.\n",
	       maxax+1, maxay+1, maxbx+1, maxby+1);
	return 0;
}