poj1088

import java.util.Scanner;

public class poj1088 {
static int r;
static int c;
static int[][] color;
static int[][] arr;
static int len[][];
static int max = 0;

public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
r = scan.nextInt();
c = scan.nextInt();
arr = new int[r][c];
color = new int[r][c];
len = new int[r][c];
for (int i = 0; i < r; i++)
for (int j = 0; j < c; j++) {
arr[i][j] = scan.nextInt();
color[i][j] = 0;
}
for (int i = 0; i < r; i++)
for (int j = 0; j < c; j++) {
if (color[i][j] == 0)
dfs(i, j);
if (len[i][j] > max)
max = len[i][j];
}
System.out.println(max);

}

private static int dfs(int i, int j) {
if (color[i][j] == 1)
return len[i][j];
else {
int temp = 1;
color[i][j] = 1;

if (i > 0 && arr[i][j] > arr[i - 1][j]) {
temp = dfs(i - 1, j) + 1;
}
if (j > 0 && arr[i][j] > arr[i][j - 1]) {
int temp1 = dfs(i, j - 1) + 1;
if (temp < temp1)
temp = temp1;
}
if (i < r - 1 && arr[i][j] > arr[i + 1][j]) {
int temp1 = dfs(i + 1, j) + 1;
if (temp < temp1)
temp = temp1;
}
if (j < c - 1 && arr[i][j] > arr[i][j + 1]) {
int temp1 = dfs(i, j + 1) + 1;
if (temp < temp1)
temp = temp1;
}
len[i][j] = temp;
return temp;

}
}

}