#include "bits/stdc++.h"
#pragma GCC optimize("Ofast")

// Begin Header {{{
using namespace std;

#ifndef DEBUG
#define dump(...)
#endif

#define all(x) x.begin(), x.end()
#define rep(i, n) for (intmax_t i = 0, i##_limit = (n); i < i##_limit; ++i)
#define reps(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)
#define var(Type, ...) Type __VA_ARGS__; input(__VA_ARGS__)

constexpr size_t    operator""_zu(unsigned long long value) { return value; };
constexpr intmax_t  operator""_jd(unsigned long long value) { return value; };
constexpr uintmax_t operator""_ju(unsigned long long value) { return value; };

constexpr int INF = 0x3f3f3f3f;
constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;

template <class T>
using MaxHeap = priority_queue<T, vector<T>, less<T>>;
template <class T>
using MinHeap = priority_queue<T, vector<T>, greater<T>>;

inline void input() {}
template <class Head, class... Tail>
inline void input(Head&& head, Tail&&... tail) {
    cin >> head;
    input(forward<Tail>(tail)...);
}

template <class T>
inline void input(vector<T> &vec) {
    for (auto &e: vec) {
        cin >> e;
    }
}

template <class T>
inline void input(vector<vector<T>> &mat) {
    for (auto &vec: mat) {
        input(vec);
    }
}

inline void print() { cout << "\n"; }
template <class Head, class... Tail>
inline void print(Head&& head, Tail&&... tail) {
    cout << head;
    if (sizeof...(tail)) cout << " ";
    print(forward<Tail>(tail)...);
}

template <class T>
inline ostream& operator<<(ostream &strm, const vector<T> &vec) {
    static constexpr const char *delim[] = {" ", ""};
    for (const auto &e: vec) {
        strm << e << delim[&e == &vec.back()];
    }
    return strm;
}

template <class T>
inline vector<T> make_v(const T &initValue, size_t sz) {
    return vector<T>(sz, initValue);
}

template <class T, class... Args>
inline auto make_v(const T &initValue, size_t sz, Args... args) {
    return vector<decltype(make_v<T>(initValue, args...))>(sz, make_v<T>(initValue, args...));
}

template <class Func>
class FixPoint : Func {
public:
    explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}

    template <class... Args>
    constexpr decltype(auto) operator()(Args&&... args) const {
        return Func::operator()(*this, std::forward<Args>(args)...);
    }
};

template <class Func>
static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {
    return FixPoint<Func>{forward<Func>(f)};
}

template <class T>
inline bool chmax(T &a, const T &b) noexcept {
    return b > a && (a = b, true);
}

template <class T>
inline bool chmin(T &a, const T &b) noexcept {
    return b < a && (a = b, true);
}

template <class T>
inline T diff(const T &a, const T &b) noexcept {
    return a < b ? b - a : a - b;
}
// End Header }}}

constexpr int MOD = int(1e9) + 7;

// ModInt {{{
template <intmax_t MOD>
class ModInt {
    intmax_t value;

public:
    inline ModInt(const ModInt& other) noexcept : value(other.value) {}
    inline ModInt(int_fast64_t value = 0) noexcept :
        value((value >= MOD) ? value % MOD : (value < 0) ? (value + MOD) % MOD : value) {}

    inline ModInt inv() const noexcept { return ModInt::pow(value, MOD - 2); }

    inline ModInt& operator+=(const ModInt& other) noexcept {
        value = (value + other.value) % MOD; return *this;
    }
    inline ModInt& operator-=(const ModInt& other) noexcept {
        value = (MOD + value - other.value) % MOD; return *this;
    }
    inline ModInt& operator*=(const ModInt& other) noexcept {
        value = (value * other.value) % MOD; return *this;
    }
    inline ModInt& operator/=(const ModInt& other) noexcept {
        value = (value * other.inv().value) % MOD; return *this;
    }

    inline ModInt operator+(const ModInt& other) noexcept { return ModInt(*this) += other; }
    inline ModInt operator-(const ModInt& other) noexcept { return ModInt(*this) -= other; }
    inline ModInt operator*(const ModInt& other) noexcept { return ModInt(*this) *= other; }
    inline ModInt operator/(const ModInt& other) noexcept { return ModInt(*this) /= other; }

    inline bool operator==(const ModInt& other) noexcept { return value == *other; }
    inline bool operator!=(const ModInt& other) noexcept { return value != *other; }

    template <class int_>
        explicit inline operator int_() const noexcept { return static_cast<int_>(value); }

    friend ostream& operator<<(ostream &os, ModInt other) noexcept {
        os << other.value; return os;
    }

    friend istream& operator>>(istream &is, ModInt& other) noexcept {
        is >> other.value; return is;
    }

    static constexpr inline ModInt pow(intmax_t n, intmax_t p) noexcept {
        int_fast64_t ret = 1;
        for (; p > 0; p >>= 1) {
            if (p & 1) ret = (ret * n) % MOD;
            n = (n * n) % MOD;
        }
        return ret;
    }
};

using Mint = ModInt<MOD>;
// }}}

#define DEBUG

// Factorial {{{
#ifdef DEBUG
#define constexpr
#endif

template <size_t N, int M>
struct Factorial {
    uint_fast64_t fact_[N + 1];

    constexpr inline Factorial() : fact_{1} {
        for (int_fast64_t i = 1; i <= N; ++i) fact_[i] = (fact_[i - 1] * i) % M;
    }

    constexpr inline Mint operator[] (size_t pos) const { return fact_[pos]; }
};

template <size_t N, int M>
struct InvFact {
    uint_fast64_t inv_[N + 1];
    uint_fast64_t finv_[N + 1];

    constexpr inline InvFact() : inv_{0, 1}, finv_{1, 1} {
        for (int_fast64_t i = 2; i <= N; ++i) {
            inv_[i] = M - inv_[M % i] * (M / i) % M;
            finv_[i] = finv_[i - 1] * inv_[i] % M;
        }
    }

    constexpr inline Mint operator[] (size_t pos) const { return finv_[pos]; }
};

#ifdef constexpr
#undef constexpr
#endif

Factorial<intmax_t(2e6) + 10, MOD> fact;
InvFact<intmax_t(2e6) + 10, MOD> finv;

inline Mint nCr(int n, int r) {
    if (n < r) return 0;
    if (n < 0 || r < 0) return 0;
    return fact[n] * (finv[r] * finv[n - r]);
}

inline Mint nPr(int n, int r) {
    if (n < r) return 0;
    if (n < 0 || r < 0) return 0;
    return fact[n] * finv[r];
}
// }}}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    var(intmax_t, x1, y1, x2, y2);

    Mint res = 0;
    reps(y, y1, y2) {
        Mint numer = Mint(x2 + 1) * fact[x1] * fact[x2 + y + 1] - Mint(x1) * fact[x2 + 1] * fact[x1 + y];
        Mint denom = Mint(y + 1) * fact[x1] * fact[x2 + 1] * fact[y];
        res += numer / denom;
    }

    print(res);

    return 0;
}


Measured memory_bytes: 47104