#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;
const ll mod = 1000000007;
#define maxn 2010
int n, m;
int ne[2][4] = {0, 0, 1, -1, 1, -1, 0, 0};
int a[maxn][maxn], f[maxn][maxn];
int dfs(int x, int y, int k)
{
    if (f[x][y])
        return f[x][y];

    for (int i = 0; i < 4; i++)
    {
        int xx = x + ne[0][i], yy = y + ne[1][i];

        if (xx <= 0 || yy <= 0 || x > n || y > m)
            continue;
        if (a[xx][yy] - a[x][y] == 1)
        {
            f[x][y] += dfs(xx, yy, k + 1);
            f[x][y] %= mod;
        }
    }
    if (f[x][y] == 0 && k>=4)
        f[x][y] = 1;

    return f[x][y];
}
void solve()
{
    memset(f, 0, sizeof f);
    memset(a, 0x3f, sizeof a);
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            cin >> a[i][j];
        }
    }
    int sum = 0;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            int ff = 1;
            for (int l = 0; l < 4; l++)
            {
                if (a[i][j] - a[i + ne[0][l]][j + ne[1][l]] == 1)
                {
                    ff = 0;
                }
            }
            if (ff)
            {
                sum += dfs(i, j, 1);
                sum %= mod;
            }
        }
    }
    cout << sum << endl;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}