/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author champon
 */

#include <iostream>
#include <fstream>

#include <bits/stdc++.h>
#define ok cout << "ok" << endl;
#define sp << " " <<
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const ll inf = 9e18;
template<typename T1, typename T2> ll ceill(T1 a, T2 b){ return (a+b-1)/b; }
void ans(bool b, ostream& out=cout){ out << (b ? "Yes" : "No") << endl; }
void ans2(bool b, ostream& out=cout){ out << (b ? "YES" : "NO") << endl; }
template<typename T> inline bool chmax(T &a, T b){ if(a<b){a=b; return true;} return false; }
template<typename T> inline bool chmin(T &a, T b){ if(a>b){a=b; return true;} return false; }
template<typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val){fill((T*)array, (T*)(array+N), val);}
int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy[] = {0, 1, 0, -1, 1, -1, -1, 1};

#ifndef INCLUDE_DEBUG_HPP
#define INCLUDE_DEBUG_HPP

#include <iostream>
#include <vector>
#include <map>
using namespace std;

class debug
{
public:
    typedef long long ll;
    template<typename T> void vd(vector<T> vec);
    template<typename T> void vd2(vector<vector<T>> vec);
    template<typename T> void vpd(vector<pair<int, int>> vec);
    template<typename T> void ad(T *arr, ll n);
    template<typename T, size_t N> void ad2(T (&arr)[N], ll n);
    template<typename T> void md(T mp);
};

#endif //INCLUDE_DEBUG_HPP

template<typename T> void debug::vd(vector<T> vec)
{
    for(auto vv : vec) cout << vv << " ";
    cout << endl;
}

template<typename T> void debug::vd2(vector<vector<T>> vec)
{
    for(auto vv : vec) for(auto vvv : vv) cout << vvv << " ";
    cout << endl;
}

template<typename T> void debug::vpd(vector<pair<int, int>> vec) {
    for(auto const& vv : vec) {
        cout << vv.first << " " << vv.second << endl;
    }
    cout << endl;
}

template<typename T> void debug::ad(T *arr, ll n)
{
    for(int i=0; i<=n; i++) cout << arr[i] << " ";
    cout << endl;
}

template<typename T, size_t N> void debug::ad2(T (&arr)[N], ll n)
{
    for(int i=0; i<=N; i++) for(int j=0; j<=n; j++) cout << arr[i][j] << " ";
    cout << endl;
}

template<typename T> void debug::md(T mp)
{
    cout << "key : value" << endl;
    for(auto const& m : mp) cout << m.first << " : " << m.second << endl;
    cout << endl;
}
debug debug;

#ifndef DEFINE_COMBINATION_HPP
#define DEFINE_COMBINATION_HPP


using namespace std;

template<typename T>
class Comb
{
    typedef long long ll;
    ll mod = 1e9+7;
  public:
    vector<vector<T>> comb;
    vector<T> fact;
    vector<T> finv;
    vector<T> inv;
    Comb(){};
    Comb(int n) { build(n); }

    void build(int n);
    T result(int n, int k); // return nCk
};

#endif //DEFINE_COMBINATION_HPP

template<typename T>
void Comb<T>::build(int n)
{
    inv.assign(n+1, 0);
    fact.assign(n+1, 0);
    finv.assign(n+1, 0);
    fact[0] = fact[1] = finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i=2; i<=n; i++){
        fact[i] = fact[i-1]*i % mod;
        inv[i] = mod - inv[mod%i]*(mod/i)%mod;
        finv[i] = finv[i-1]*inv[i]%mod;
    }
}

template<typename T>
T Comb<T>::result(int n, int k)
{
    if(n < k) return 0;
    if(n < 0 || k < 0) return 0;
    return fact[n]*(finv[k]*finv[n-k]%mod)%mod;
}

// verify
// https://atcoder.jp/contests/abc034/tasks/abc034_c

#ifndef INCLUDE_MINT_HPP
#define INCLUDE_MINT_HPP

class mint
{
public:
    const int mod = 1e9+7;
    typedef long long ll;
    ll a;
    mint(ll a=0):a((a%mod + mod)%mod){}
    mint operator-() const { return mint(-a); }
    mint operator+(const mint rhs) const {
        mint res(*this);
        return res+=a;
    }
    mint operator-(const mint rhs) const {
        mint res(*this);
        return res-=a;
    }
    mint operator*(const mint rhs) const {
        mint res(*this);
        return res*=a;
    }
    mint& operator+=(const mint rhs) {
        if((a += rhs.a) >= mod) a -= mod;
        return *this;
    }
    mint& operator-=(const mint rhs) {
        if((a += mod-rhs.a) >= mod) a -= mod;
        return *this;
    }
    mint& operator*=(const mint rhs) {
        (a *= rhs.a) %= mod;
        return *this;
    }
    mint pow(ll t) const {
        if(!t) return 1;
        mint b = pow(t>>1);
        b *= b;
        if(t&1) b *= *this;
        return b;
    }

    mint inv() const {
        return pow(mod-2);
    }
    mint& operator/=(const mint rhs) {
        return (*this) *= rhs.inv();
    }
    mint operator/(const mint rhs) const {
        mint res(*this);
        return res/=rhs;
    }
};

#endif //INCLUDE_MINT_HPP


class FManyManyPaths {
public:
	void solve(std::istream& in, std::ostream& out)
	{
        int r1, c1, r2, c2;
        in >> r1 >> c1 >> r2 >> c2;

        Comb<ll> cmb(2400010);
        mint res(0LL);
        for(int i=r1; i<=r2; i++){
            mint a = mint((c2+1) * cmb.result(c2 + i + 1, i) - c1 * cmb.result(c1 + i, i));
            mint b = mint(i + 1);
            res += a/b;

            //cout << a.a sp b.a sp res.a << endl;
        }

        out << res.a << endl;
	}
};


int main() {
	FManyManyPaths solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
	solver.solve(in, out);
	return 0;
}


Measured memory_bytes: 56448