#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <vector>
#define INF 0x3f3f3f3f
#define debug(x) std::cout<<#x<<":"<<x<<endl
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef double db;
const int N=1e6;
const int P = 1e9 + 7;
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, -1, 1}; 
signed main() {
    #ifndef ONLINE_JUDGE
        freopen("/Users/holden/Desktop/code/cin.in", "r", stdin);
        freopen("/Users/holden/Desktop/code/cout.out", "w", stdout);
    #endif

    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m;
    cin >> n >> m;
    vector<vector<int>> g(n,vector<int>(m));
    vector<vector<vector<ll>>> dp(n,vector(m, vector<ll>(5)));
    vector<vector<char>> f(n, vector<char>(m,1));
    vector<pair<int, pii>> v;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            cin >> g[i][j];
            v.push_back({g[i][j], {i, j}});
            dp[i][j][1] = 1;
        }
    }
    sort(v.begin(), v.end());
    for (auto it : v) {
        for (int i = 0; i < 4; ++i) {
            int x = it.second.first + dx[i];
            int y = it.second.second + dy[i];
            if (x >= 0 && x < n && y >= 0 && y < m && g[x][y] == g[it.second.first][it.second.second] + 1) {
                for (int j = 2; j <= 4; ++j) {
                    dp[x][y][j] = (dp[x][y][j] + dp[it.second.first][it.second.second][j - 1]) % P;
                }
                dp[x][y][4] = (dp[it.second.first][it.second.second][4] + dp[x][y][4]) % P;
                dp[x][y][1] = 0;
            }
        }
    }
    ll ans = 0;
    //cout << dp[1][2][3] << '\n';
    
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            bool f = true;
            for (int k = 0; k < 4; ++k) {
                int x = i + dx[k];
                int y = j + dy[k];
                if (x >= 0 && x < n && y >= 0 && y < m && g[x][y] == g[i][j] + 1) {
                    f = false;
                }
            } 

            if (!f) continue;
            //cout << i << ' ' << j << '\n';
            ans = (ans + dp[i][j][4]) % P;
            ans %= P;
        }
    }
    cout << ans;
    return 0;
}