#include <bits/stdc++.h>

using namespace std;

const int Nmax = 1005;
const int inf = 1e9;

int dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};

vector<pair<int,int>> edge[Nmax][Nmax];
int dist[Nmax][Nmax], Dist[Nmax][Nmax];
int a[Nmax][Nmax];
int n, m;
bool ok[Nmax][Nmax];



void dfs(int x, int y)
{
    for(auto it : edge[x][y])
    {
        dist[it.first][it.second] = dist[x][y] + 1;
        dfs(it.first, it.second);
    }
}

bool valid(int x, int y)
{
    return (1 <= x && x <= n && 1 <= y && y <= m);
}

void solve(int x, int y)
{
    int val = a[x][y];
    int i, j, k;

    for(i=1; i<=n; ++i)
        for(j=1; j<=m; ++j)
        {
            edge[i][j].clear();
            dist[i][j] = -1;
        }

    for(i=1; i<=n; ++i)
        for(j=1; j<=m; ++j)
        {
            if(i == x && j == y) continue;

            int curr_abs = inf, curr_abs2 = inf, pos_i = -1, pos_j = -1;
            for(k=0; k<4; ++k)
            {
                int ii = i + dx[k];
                int jj = j + dy[k];

                if(valid(ii, jj))
                {
                    if(abs(a[ii][jj] - val) < curr_abs || (abs(a[ii][jj] - val) == curr_abs && abs(a[ii][jj] - a[i][j]) < curr_abs2))
                    {
                        curr_abs = abs(a[ii][jj] - val);
                        curr_abs2 = abs(a[ii][jj] - a[i][j]);
                        pos_i = ii;
                        pos_j = jj;
                    }
                }
            }

            edge[pos_i][pos_j].push_back({i, j});
        }

    dist[x][y] = 0;
    dfs(x, y);

    for(i=1; i<=n; ++i)
        for(j=1; j<=m; ++j)
        {
            Dist[i][j] = max(Dist[i][j], dist[i][j]);
            ok[i][j] &= (dist[i][j] != -1);
        }
}

int main()
{
 //   freopen("input", "r", stdin);
    cin.tie(0); cin.sync_with_stdio(false);

    cin >> n >> m;

    int i, j;

    for(i=1; i<=n; ++i)
        for(j=1; j<=m; ++j)
        {
            cin >> a[i][j];
            ok[i][j] = 1;
        }

    for(i=1; i<=n; ++i)
        for(j=1; j<=m; ++j)
            solve(i, j);

    bool have_answer = 0;
    int x, y;

    for(i=1; i<=n; ++i)
        for(j=1; j<=m; ++j)
            if(ok[i][j])
            {
                if(!have_answer || Dist[i][j] < Dist[x][y])
                {
                    have_answer = 1;
                    x = i, y = j;
                }
            }

    if(!have_answer)
        cout << "impossible\n";
    else cout << a[x][y] << ' ' << Dist[x][y] << '\n';

    return 0;
}