#include <stdio.h>
#include <string.h>
#include <math.h>
int main()
{
int n,m,a[30][30],i,j,max,flag_i,flag_j,sum;
while(~scanf("%d%d",&n,&m) && (n||m))
{
memset(a,0,sizeof(a));
for(i = 1; i<=n; i++)
{
for(j = 1; j<=m; j++)
{
scanf("%d",&a[i][j]);
}
}
max = -10000;
for(i = 1; i<=n; i++)
{
for(j = 1; j<=m; j++)
{
sum = 0;
//int q,w,e,r;
if(i<n)
{
if(a[i+1][j]*a[i][j]<0)
sum+= fabs(a[i+1][j]);
else
sum-= fabs(a[i+1][j]);
}
if(i>1)
{
if(a[i-1][j]*a[i][j]<0)
sum+= fabs(a[i-1][j]);
else
sum-= fabs(a[i-1][j]);
}
if(j<m)
{
if(a[i][j+1]*a[i][j]<0)
sum+= fabs(a[i][j+1]);
else
sum-= fabs(a[i][j+1]);
}
if(j>1)
{
if(a[i][j-1]*a[i][j]<0)
sum+= fabs(a[i][j-1]);
else
sum-= fabs(a[i][j-1]);
}
if(sum>max)
{
max = sum;
flag_i = i;
flag_j = j;
}
}
}
printf("%d %d %d\n",flag_i,flag_j,max);
}
return 0;
}