#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define fi first
#define se second
#define mkp make_pair
#define pb emplace_back
#define popcnt __builtin_popcountll
const int mod = 1e9+7;
inline int read(){
	int x=0, f=1; char ch=getchar();
	while(ch<'0' || ch>'9') { if(ch=='-') f=-1; ch=getchar(); }
	while(ch>='0' && ch<='9') x=x*10+ch-'0', ch=getchar();
	return x*f;
}
inline int qpow(int a,int b){
	int ans=1, base=a;
	while(b){
		if(b&1) ans=1ull*ans*base%mod;
		base=1ull*base*base%mod; b>>=1;
	}
	return ans;
}
#define P pair<int,int>
int n,m,a[1005][1005],c;
int dp[1005][1005][5];
P seq[1000005];
void addmod(int &x){ if(x >= mod) x -= mod; }
int dx[4] = {1,0,0,-1}, dy[4] = {0,1,-1,0};
void init(){ }
void procedure(){
	n=read(), m=read();	
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			a[i][j]=read();
			seq[++c] = mkp(i,j);
		}
	}

	sort(seq+1, seq+c+1, [](P A, P B){ return a[A.fi][A.se] < a[B.fi][B.se]; });
	int ans = 0;
	for(int t=1;t<=c;t++){
		int x=seq[t].fi, y=seq[t].se;
		bool st=1, ed=1;
		for(int d=0; d<4; d++){
			int tx=x+dx[d], ty=y+dy[d];
			if(tx>=1 && tx<=n && ty>=1 && ty<=m){
				if(a[tx][ty] == a[x][y]-1){
					st = 0;
					for(int q=0;q<=3;q++)
						addmod(dp[x][y][min(3,q+1)] += dp[tx][ty][q]);
				}
				if(a[tx][ty] == a[x][y]+1) ed = 0;
			}
		}
		if(st) addmod(dp[x][y][0] += 1);
		if(ed) addmod(ans += dp[x][y][3]);
	}
	printf("%d\n", ans);
}
int main(){
	#ifdef LOCAL
		assert(freopen("input.txt","r",stdin));
		assert(freopen("output.txt","w",stdout));
	#endif
	ll T=1;
	init();
	while(T--) procedure();
	return 0;
}