hdoj_2022

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