#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
#define mp make_pair
inline int read()
{
int X=0; bool flag=1; char ch=getchar();
while(ch<'0'||ch>'9') {if(ch=='-') flag=0; ch=getchar();}
while(ch>='0'&&ch<='9') {X=(X<<1)+(X<<3)+ch-'0'; ch=getchar();}
if(flag) return X;
return ~(X-1);
}
const ll mod=1000000007;
ll qpow(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
inline int gcd(int a, int b){return b == 0 ? a : gcd(b, a % b);}
inline int lcm(int a, int b){return a / gcd(a, b) * b;}
#define maxn 200010

int a[1010][1010],f[1010][1010];
int dir[4][2] = {0,1,0,-1,1,0,-1,0};
int n,m;

int dfs(int x,int y)
{
    if(f[x][y]) return f[x][y];
    for(int i=0;i<4;i++)
    {
        int xx = x+dir[i][0],yy = y+dir[i][1];
        if(xx<=0||yy<=0||xx>n||yy>m) continue;
        if(a[xx][yy]-a[x][y]==1) f[x][y] += dfs(xx,yy);
        f[x][y] %= mod;
    }
    if(!f[x][y]) return f[x][y] = 1;
    return f[x][y];
}

void solve()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++) 
            cin>>a[i][j];
    int ans = 0;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
        {
            int ff = 1,ff1 = 0;
            for(int k=0;k<4;k++)
            {
                int xx = i+dir[k][0],yy = j+dir[k][1];
                if(xx<=0||yy<=0||xx>n||yy>m) continue;
                if(a[xx][yy]-a[i][j]==-1) ff = 0;
                if(a[xx][yy]-a[i][j]==1) ff1 = 1;
            }
            if(ff&&ff1)
            {
                ans += dfs(i,j);
                ans %= mod;
            }
        }
    cout<<ans<<'\n';
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
int t=1;
//cin>>t;
while(t--)
    solve();
return 0;
}