2 3
5 -4 3
-6 3 7
0 0

1 2 11

#include<stdio.h>
#include<string.h>
#include<algorithm>
int a[102][102],dp[102][102];
int main()
{
	int i,j,n,m,k,t,ans;
	while(scanf("%d%d",&n,&m)&&(m+n)){
	memset(dp,0,sizeof(dp));
	memset(a,0,sizeof(a));
	for(i=1;i<=n;i++)
	    for(j=1;j<=m;j++)
	    scanf("%d",&a[i][j]);
	for(i=1;i<=n;i++)
	    for(j=1;j<=m;j++)
	    {
	    	if(a[i][j]*a[i-1][j]>0)
	    	dp[i][j]-=abs(a[i-1][j]);
	    	else
	    	dp[i][j]+=abs(a[i-1][j]);
	    	if(a[i][j]*a[i+1][j]>0)
	    	dp[i][j]-=abs(a[i+1][j]);
	    	else
	    	dp[i][j]+=abs(a[i+1][j]);
	    	if(a[i][j]*a[i][j-1]>0)
	    	dp[i][j]-=abs(a[i][j-1]);
	    	else
	    	dp[i][j]+=abs(a[i][j-1]);
	    	if(a[i][j]*a[i][j+1]>0)
	    	dp[i][j]-=abs(a[i][j+1]);
	    	else
	    	dp[i][j]+=abs(a[i][j+1]);
		}
	int ans=-1000;
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=m;j++)
		{
			if(dp[i][j]>ans){
				k=i;t=j;ans=dp[i][j];
			}
		}
	}
	printf("%d %d %d\n",k,t,ans);}
	return 0;
}