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

//  a^b % m
long long powmod(long long a, long long b, long long m)
{
    long long r = 1;
    for (; b>0; b>>=1, a=a*a%m)
        if (b&1)
            r = r*a%m;
    return r;
}

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

    long long M = 1000000007;
    vector<long long> F(2000002);
    F[0] = 1;
    for (int i=1; i<=2000001; i++)
        F[i] = F[i-1]*i%M;

    auto C = [&](long long x, long long y)
    {
        return F[x]*powmod(F[y], M-2, M)%M*powmod(F[x-y], M-2, M)%M;
    };

    long long ans = 0;
    for (long long r=r1; r<=r2; r++)
    {
        ans += C(r+c2+1, c2) - C(r+c1, c1-1);
        ans = (ans%M+M)%M;
    }
    cout<<ans<<endl;
}
