#include<iostream>
#include<cmath>
int main(){
int n,m;
long a[100][100];
while(scanf("%d%d",&n,&m)!=EOF){
int max=0,count1=0,count2=0;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
scanf("%d",a[i][j]);
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
if(abs(a[i][j])>abs(max)){
max=a[i][j];
count1=i;
count2=j;
}
printf("%d%d%d\n",count1,count2,max);
}
return 0;
}