#include<bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007

const int MAX = 3000005;
int fac[MAX], inv[MAX], finv[MAX];

void pre(){
  inv[1]=1;
  for (int i = 2; i <MAX ; i++)
  {
    inv[i]=inv[mod%i]*(mod-mod/i)%mod;
  }
  fac[0]=finv[0]=1;
  for (int i = 1; i < MAX; ++i)
  {
    fac[i]=fac[i-1]*i%mod;
    finv[i]=finv[i-1]*inv[i]%mod;
  }
}
int ncr(int n, int r){
  if(r<0||r>n)return 0;
  return fac[n]*finv[r]%mod*finv[n-r]%mod;
}

signed main(){
    pre();
    
    int r1, c1, r2, c2;
    cin >> r1 >> c1 >> r2 >> c2;

    int ans = 0;

    for(int i = r1; i<=r2;i++){
        int cur = (c2+1)*ncr(i+c2+1, c2+1)%mod - (c1)*ncr(c1+i,c1)%mod;
        cur = (cur+mod)%mod;
        cur = cur*inv[i+1]%mod;
        ans = (ans+cur)%mod;
    }

    cout << ans << endl;


    return 0;
}
