#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=1e9+7;
ll powmod(ll a, ll k){
    ll ap=a, ans=1;
    while(k){
        if(k&1){
            ans*=ap;
            ans%=MOD;
        }
        ap=ap*ap;
        ap%=MOD;
        k>>=1;
    }
    return ans;
}
ll inv(ll a){
    return powmod(a, MOD-2);
}
ll f[1100000], invf[1100000];
void fac(int n){
    f[0]=1;
    for(ll i=1; i<=n; i++) f[i]=f[i-1]*i%MOD;
    invf[n]=inv(f[n]);
    for(ll i=n-1; i>=0; i--) invf[i]=invf[i+1]*(i+1)%MOD;
}
ll comb(int x, int y){
    if(!(0<=y && y<=x)) return 0;
    return f[x]*invf[y]%MOD*invf[x-y]%MOD;
}
int main()
{
    fac(1002000);
    int n, m; cin>>n>>m;
    int s[1010][1010]={};
    for(int i=0; i<n; i++) for(int j=0; j<m; j++) cin>>s[i][j];
    ll ans=0;
    for(int i=0; i<n; i++){
        for(int j=0; j<m; j++){
            (ans+=f[i+j+s[i][j]-1]*invf[i]%MOD*invf[j]%MOD*invf[s[i][j]-1])%=MOD;
        }
    }
    for(int i=0; i<n; i++){
        for(int j=0; j<m; j++){
            if(s[i][j]>s[i+1][j]){
                (ans+=comb(s[i][j]+i+j, i+j+1)*comb(i+j, i))%=MOD;
                (ans+=MOD-comb(s[i+1][j]+i+j, i+j+1)*comb(i+j, i)%MOD)%=MOD;
                //for(int k=s[i+1][j]; k<s[i][j]; k++) (ans+=f[i+j+k]*invf[i]%MOD*invf[j]%MOD*invf[k])%=MOD;
            }
        }
    }
    for(int i=0; i<n; i++){
        for(int j=0; j<m; j++){
            if(s[i][j]>s[i][j+1]){
                (ans+=comb(s[i][j]+i+j, i+j+1)*comb(i+j, i))%=MOD;
                (ans+=MOD-comb(s[i][j+1]+i+j, i+j+1)*comb(i+j, i)%MOD)%=MOD;
                //for(int k=s[i][j+1]; k<s[i][j]; k++) (ans+=f[i+j+k]*invf[i]%MOD*invf[j]%MOD*invf[k])%=MOD;
            }
        }
    }
    cout<<ans<<endl;
    return 0;
}