#include<bits/stdc++.h>

using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);


using ll = long long;
#define int ll
#define endl "\n"
#define no cout << "NO" << endl
#define yes cout << "YES" << endl
#define pii pair<int,int>
#define ary(i) array<ll,(i)>
#define all(x) x.begin(),x.end()
const int maxn = 2e5 + 7;
const int inf = numeric_limits<int>::max();
const int inf2 = 0x3f3f3f3f3f3f3f3;
const int inff = numeric_limits<int>::min();
const int mod = 1e9 + 7;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};

void solve() {
    int n, m;
    cin >> n >> m;
    vector<vector<int>> mp(n + 3, vector<int>(m + 3, inff));
    vector<vector<vector<int>>>
            ans(n + 3, vector<vector<int>>
            (m + 3, vector<int>(4, 0)));
    vector<vector<int>> du(n + 3, vector<int>(m + 3, 0));
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cin >> mp[i][j];
        }
    }
//    cerr<<m<<n<<endl;
    queue<pair<int, int>> q;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            for (int k = 0; k < 4; k++) {
                int lx = dx[k] + i;
                int ly = dy[k] + j;
                if (mp[lx][ly] - mp[i][j] == 1) {
                    du[lx][ly]++;
                }
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            if (du[i][j] == 0) {
                q.emplace(i, j);
                ans[i][j][0] = 1;
            }
        }
    }
    int res = 0;
    while (!q.empty()) {
        auto [x, y] = q.front();
        q.pop();
        bool flag = true;
        for (int i = 0; i < 4; i++) {
            int lx = dx[i] + x;
            int ly = dy[i] + y;
            if (mp[lx][ly] - mp[x][y] == 1) {
                flag = false;
                du[lx][ly]--;
                if (du[lx][ly] == 0) {
                    q.emplace(lx, ly);
                }
                ans[lx][ly][1] += ans[x][y][0];
                ans[lx][ly][1] %= mod;
                ans[lx][ly][2] += ans[x][y][1];
                ans[lx][ly][2] %= mod;
                ans[lx][ly][3] += ans[x][y][2] + ans[x][y][3];
                ans[lx][ly][3] %= mod;
            }

        }
        if (flag) {
            res += ans[x][y][3];
            res %= mod;
        }
    }
    cout<<res<<endl;
}

#undef int


int main() {
    IOS
    int t;
//    cin >> t;
    t = 1;
    while (t--) {
        solve();
    }

}