Snuke is standing on a two-dimensional plane. In one operation, he can move by 1 in the positive x-direction, or move by 1 in the positive y-direction.

Let us define a function f(r, c) as follows:

* f(r,c) :=  (The number of paths from the point (0, 0) to the point (r, c) that Snuke can trace by repeating the operation above)



Given are integers r_1, r_2, c_1, and c_2. Find the sum of f(i, j) over all pair of integers (i, j) such that r_1 ≤ i ≤ r_2 and c_1 ≤ j ≤ c_2, and compute this value modulo (10^9+7).

Constraints

* 1 ≤ r_1 ≤ r_2 ≤ 10^6
* 1 ≤ c_1 ≤ c_2 ≤ 10^6
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


r_1 c_1 r_2 c_2


Output

Print the sum of f(i, j) modulo (10^9+7).

Examples

Input

1 1 2 2


Output

14


Input

314 159 2653 589


Output

602215194
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main {
    private static final long MOD = 1_000_000_007L;
    private static int TARGET = 2000002;
    private static long[] mod = new long[TARGET];
    private static Map<Long, Long> pre = new HashMap<>();

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        initmod();
        int r1,r2,c1,c2;
        r1=sc.nextInt();
        c1=sc.nextInt();
        r2=sc.nextInt();
        c2=sc.nextInt();
        assert(com(5,2) % MOD == 10);
        assert(com(4,2) % MOD == 6);
        long res;
        res = calc(r2, c2) - calc(r1-1, c2) - calc(r2, c1-1) + calc(r1-1, c1-1);
        res += MOD;
        res %= MOD;
        System.out.println(res);

    }

    private static long calc(int r, int c){
        if(r < 0 || c < 0){
            return 0;
        }
        long sum = 0;
        for(int i=1;i<=r+1;i++){
            sum += com(i+c, c);
            sum %= MOD;
        }
        return sum;
    }



    private static long com(int n, int k){
        long res = mod[n] * modinv(mod[n-k]) % MOD;
        res *= modinv(mod[k]);
        res %= MOD;
        return res;
    }


    private static void initmod(){
        mod[0]=1;
        mod[1]=1;
        for(int i=2;i<TARGET;i++){
            mod[i] = (mod[i-1] * i) % MOD;
        }
    }

    private static long modpow(long n, long k){
        if(k==0){
            return 1;
        }
        if(k==1){
            return n % MOD;
        }
        long res = modpow( n , k/2);
        res = (res * res) % MOD;
        if(k % 2 == 1){
            return (res * n) % MOD;
        }else{
            return res;
        }
    }


    public static long modinv(long n){
        if(pre.containsKey(n)){
            return pre.get(n);
        }else{
            pre.put(n, modpow(n, MOD-2));
            return pre.get(n);
        }
    }
}
