#include <iostream>

#include <string>

#include <cstring>

#include <cstdlib>

#include <cstdio>

#include <cmath>

#include <algorithm>

#include <stack>

using namespace std;

#define mem(a,b) memset(a,b,sizeof(a))

#define pf printf

#define sf scanf

#define debug printf("!\n")

#define INF 10000

#define MAX(a,b) a>b?a:b

#define blank pf("\n")

#define LL long long

int n,m,V;

int dp[][],map[][];

int f(int i,int j)

{

          if(dp[i][j]!=)

                    return dp[i][j];

          int w,s,a,d;

          if(i->=)

          {

                    if(map[i-][j]<map[i][j]) s=f(i-,j)+;

                    else s=;

          }

          else s=;

          if(i+<=n)

          {

                    if(map[i+][j]<map[i][j]) w=f(i+,j)+;

                    else w=;

          }

          else w=;

          if(j->=)

          {

                    if(map[i][j-]<map[i][j]) a=f(i,j-)+;

                    else a=;

          }

          else a=;

          if(j+<=m)

          {

                    if(map[i][j+]<map[i][j]) d=f(i,j+)+;

                    else d=;

          }

          else d=;

          int max1 = max(w,s);

          int max2 = max(a,d);

          return max(max1,max2);

}

int main()

{

          int i,j,t;

          while(~sf("%d%d",&n,&m))

          {

                    mem(dp,);

                    dp[][] =;

                    for(i=;i<=n;i++)

                    {

                              for(j = ;j<=m;j++)

                                        sf("%d",&map[i][j]);

                    }

                    int max = ;

                    for(i=;i<=n;i++)

                    {

                              for(j = ;j<=m;j++)

                              {

                                        dp[i][j]=f(i,j);

                                        if(max<dp[i][j]) max = dp[i][j];

                              }

                    }

                    pf("%d\n",max);

          }

}