#pragma region Header
#include <iostream>
#include <iomanip>
#include <cstdint>
#include <cmath>
#include <vector>
#include <array>
#include <queue>
#include <stack>
#include <tuple>
#include <set>
#include <map>
#include <unordered_map>
#include <bitset>
#include <string>
#include <functional>
#include <algorithm>
#include <numeric>
#include <stdexcept>
using namespace std;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define rep(i, n) for (int i = 0; i < static_cast<int>(n); ++i)
#define repd(i, n) for (int i = static_cast<int>(n) - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = static_cast<int>(a); i < static_cast<int>(b); ++i)
#define FORD(i, a, b) for (int i = static_cast<int>(b) - 1; i >= static_cast<int>(a); --i)
template <typename T>
int SZ(T const &x)
{
    return static_cast<int>(x.size());
}
template <u32 p>
struct mint
{
private:
    // [0,p)内の値
    u32 data;

    constexpr static inline i64 p_i64 = static_cast<i64>(p);

public:
    constexpr mint() noexcept
        : data(0) {}

    constexpr mint(i64 const x) noexcept
        : data(static_cast<u32>((x % p_i64 >= 0) ? x % p_i64 : x % p_i64 + p_i64)) {}

    // unsafe constructor
    constexpr mint(u32 const x, bool const) noexcept
        : data(x) {}

    // convert to u32
    constexpr u32 const &val() const noexcept
    {
        return data;
    }

    constexpr mint &operator+=(mint const x) noexcept
    {
        data += x.data;
        if (data >= p)
        {
            data -= p;
        }
        return *this;
    }

    constexpr mint &operator-=(mint const x) noexcept
    {
        if (data < x.data)
        {
            data += p;
        }
        data -= x.data;
        return *this;
    }

    constexpr mint &operator*=(mint const x) noexcept
    {
        data = static_cast<u32>(static_cast<u64>(data) * x.data % p);
        return *this;
    }

    constexpr mint &operator/=(mint x)
    {
        if (x.data == 0)
        {
            throw domain_error("Division by mint zero");
        }
        u32 exp = p - 2;
        // (*this) * (x ** exp) : invariant
        while (exp > 0)
        {
            if (exp & 1)
            {
                *this *= x;
            }
            x *= x;
            exp /= 2;
        }
        return *this;
    }

    constexpr mint &operator++() noexcept
    {
        return *this += mint(1, true);
    }

    constexpr mint operator++(int) noexcept
    {
        mint const ret(*this);
        ++(*this);
        return ret;
    }

    constexpr mint &operator--() noexcept
    {
        return *this -= mint(1, true);
    }

    constexpr mint operator--(int) noexcept
    {
        mint const ret(*this);
        --(*this);
        return ret;
    }

    constexpr mint operator-() const noexcept
    {
        return mint(0, true) -= *this;
    }

    constexpr mint operator+(mint const x) const noexcept
    {
        return mint(*this) += x;
    }

    constexpr mint operator-(mint const x) const noexcept
    {
        return mint(*this) -= x;
    }

    constexpr mint operator*(mint const x) const noexcept
    {
        return mint(*this) *= x;
    }

    constexpr mint operator/(mint const x) const
    {
        return mint(*this) /= x;
    }

    // x >= 0 のときべき乗を計算
    constexpr mint pow(u64 exp) const noexcept
    {
        mint ret(1, true), base(*this);
        // ret * (base ** exp) : invariant, == (*this) ** x
        while (exp > 0)
        {
            if (exp & 1)
            {
                ret *= base;
            }
            base *= base;
            exp /= 2;
        }
        return ret;
    }

    constexpr mint inv() const noexcept
    {
        return mint(1, true) /= *this;
    }

    constexpr bool operator==(mint const x) const noexcept
    {
        return data == x.data;
    }
};

#pragma endregion

constexpr u32 mod = 1000'000'007;
using m32 = mint<mod>;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    int r1, c1, r2, c2;
    cin >> r1 >> c1 >> r2 >> c2;
    ++r2;
    ++c2;

    int n = r2 + c2;
    vector<m32> fact(n + 1), factinv(n + 1);
    factinv[0] = fact[0] = 1;
    rep(i, n)
    {
        fact[i + 1] = fact[i] * m32(i + 1);
        factinv[i + 1] = fact[i + 1].inv();
    }
    auto comb = [&](int x, int y) {
        return fact[x + y] * factinv[x] * factinv[y];
    };
    cout << (comb(r2, c2) - comb(r2, c1) - comb(r1, c2) + comb(r1, c1)).val() << endl;

    return 0;
}


Measured memory_bytes: 18780