C :

#include<stdio.h>
int main()
{
	int a[100][100];
	int m, n, i, j, k, f, t;
	scanf("%d%d", &m, &n);
	for(i=0; i<m; i++)
	{
		for(j=0; j<n; j++)
		{
			scanf("%d", &a[i][j]);

		}
	}

	for(i=0; i<m; i++)
	{

		for(j=0; j<n; j++)
		{
		
			if(a[i][j]>a[0][0])
			{
				k=i;
				f=j;
				t = a[i][j];
				a[i][j+1] = a[0][0];
				a[0][0] = t;
			}

		}

	}
	printf("%d %d %d", a[0][0], k, f);
	return 0;

}

C++ :

#include"stdio.h"
int main(){
	int a[100][100];
	int m,n;
	int i,j;
	int max=a[0][0];
	int x,y;
	scanf("%d%d",&m,&n);
	for(i=0;i<m;i++){
		for(j=0;j<n;j++){
		scanf("%d",&a[i][j]);
		}
	}
for (i=0;i<=m;i++)
{
   for (j=0;j<=n;j++)
   {
    if(max<a[i][j])
    {
    max=a[i][j];
    x=i;
    y=j;
    }
   }
}
	printf("%d %d %d",max,x,y);
}

Pascal :

program ngj;
var
  m,n,i,j,max:integer;
  a:array[1..100,1..100] of integer;
begin
  read(m,n);
  for i:=1 to m do
  for j:=1 to n do
  read(a[i,j]);
  max:=a[1,1];
  for i:=1 to m do
  begin
    for j:=1 to n do
    if a[i,j]>max then max:=a[i,j]
    else max:=max;
  end;
  for i:=1 to m do
  for j:=1 to n do
  if a[i,j]=max then write(a[i,j],' ',i-1,' ',j-1);
end.