//
// Created by travel on 2024/10/9.
//
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> PII;
#define endl "\n"
#define ft first
#define sd second
#define pb push_back
const int MOD = 1e9 + 7;
int n,m;
const int N = 1e6 + 10;
int h[N],e[N << 2],ne[N << 2],idx;
int in[N],dp[N][5];
int id(int a,int b){
    return (a - 1) * m + b;
}
int g[1010][1010];
int dx[] = {0,0,-1,1},dy[] = {1,-1,0,0};
void add(int a,int b){
    e[idx] = b,ne[idx] = h[a],h[a] = idx++;
}

void solve(){
    memset(h,-1,sizeof h);
    cin>>n>>m;
    for(int i = 1;i <= n;i++)
        for(int j = 1;j <= m;j++)
            cin>>g[i][j];
    for(int i = 1;i <= n;i++){
        for(int j = 1;j <= m;j++){
            for(int k = 0;k < 4;k++){
                int x = dx[k] + i,y = dy[k] + j;
                if(x >= 1 && x <= n && y >= 1 && y <= m){
                    if(g[i][j] == g[x][y] - 1){
                        int id1 = id(i,j),id2 = id(x,y);
                        add(id1,id2);
                        in[id2]++;
                    }
                }
            }
        }
    }
    queue<int> q;
    int res = 0;
    for(int i = 1;i <=n;i++){
        for(int j = 1;j <= m;j++){
            int x = id(i,j);
            if(!in[x]) {
//                cout<<i<<' '<<j<<' '<<x<<endl;
                q.push(x);
                dp[x][1] = 1;
            }
        }
    }
    while(q.size()){
        int t = q.front();
        q.pop();
        bool flag = 1;
        for(int i = h[t];~i;i = ne[i]){
            int j = e[i];
            dp[j][2] = (dp[j][2] + dp[t][1]) % MOD;
            dp[j][3] = (dp[j][3] + dp[t][2]) % MOD;
            dp[j][4] = (dp[j][4] + dp[t][3] + dp[t][4]) % MOD;
            flag = 0;
            if(--in[j] == 0)
                q.push(j);
        }
        if(flag)
            res = (res + dp[t][4]) % MOD;
//        cout<<"flag = "<<flag<<' '<<t<<' '<<dp[t][4]<<endl;
    }
    cout<<res<<endl;
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    while(T--)
        solve();
    return 0;
}
/*
 *
3 5
 1 2 3 8 7
 -1 -1 4 5 6
 1 2 3 8 7

 4 4
 1 2 3 4
 2 3 4 3
 3 4 3 2
 4 3 2 1
 */