// clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
using namespace std;
using pii = pair<int, int>;
using vi = vector<int>;
using vd = vector<double>;
using vc = vector<char>;
using vb = vector<bool>;
using vs = vector<string>;
using vpii = vector<pii>;
using vvi = vector<vi>;
using vvb = vector<vb>;
using vvpii = vector<vpii>;
template<typename A> using fn = function<A>;
constexpr int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000;
constexpr int MOD = 1000000007;
constexpr double PI = acos(-1);
template<typename A, typename B> bool cmin(A &a, const B &b) { return a > b ? (a = b, true) : false; }
template<typename A, typename B> bool cmax(A &a, const B &b) { return a < b ? (a = b, true) : false; }
constexpr bool odd(const int &n) { return n & 1; }
constexpr bool even(const int &n) { return !odd(n); }
// clang-format on
constexpr int powm(int a, int b, const int& m) {
int c = 1;
while (b) {
if (odd(b)) c = (c * a) % m;
b >>= 1;
a = (a * a) % m;
}
return c;
}
struct modint {
int v;
modint(int a = 0)
: v(((a % MOD) + MOD) % MOD) {
}
modint operator+(const modint& b) const {
return (v + b.v) % MOD;
}
modint operator-(const modint& b) const {
return (v - b.v + MOD) % MOD;
}
modint operator*(const modint& b) const {
return (v * b.v) % MOD;
}
modint operator/(const modint& b) const {
return (v * powm(b.v, MOD - 2, MOD)) % MOD;
}
};
bool operator==(const modint& a, const modint& b) {
return a.v == b.v;
}
bool operator!=(const modint& a, const modint& b) {
return a.v != b.v;
}
modint& operator+=(modint& a, const modint& b) {
return a = a + b;
}
modint& operator-=(modint& a, const modint& b) {
return a = a - b;
}
modint& operator*=(modint& a, const modint& b) {
return a = a * b;
}
modint& operator/=(modint& a, const modint& b) {
return a = a / b;
}
ostream& operator<<(ostream& out, const modint& a) {
return out << a.v;
}
istream& operator>>(istream& in, modint& a) {
int v;
in >> v;
a = modint(v);
return in;
}
main {
int h, w;
cin >> h >> w;
vvi a(h, vi(w));
rep(i, h) rep(j, w) cin >> a[i][j];
vector<vector<modint>> dp(h, vector<modint>(w));
fn<modint(int, int, int)> dfs = [&](int i, int j, int p) {
if (i < 0 || j < 0 || i >= h || j >= w || a[i][j] >= p) return modint(0);
if (dp[i][j] != modint(0)) return dp[i][j];
modint c = 0;
vi di = {1, 0, -1, 0}, dj = {0, -1, 0, 1};
rep(k, 4) c += dfs(i + di[k], j + dj[k], a[i][j]);
return dp[i][j] = c + 1;
};
modint c = 0;
rep(i, h) rep(j, w) c += dfs(i, j, INF);
cout << c << endl;
}