{"raw_statement":[{"iden":"problem statement","content":"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.\nLet us define a function $f(r, c)$ as follows:\n\n*   $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)\n\nGiven 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)$."},{"iden":"constraints","content":"*   $1 ≤ r_1 ≤ r_2 ≤ 10^6$\n*   $1 ≤ c_1 ≤ c_2 ≤ 10^6$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$r_1$ $c_1$ $r_2$ $c_2$"},{"iden":"sample input 1","content":"1 1 2 2"},{"iden":"sample output 1","content":"14\n\nFor example, there are two paths from the point $(0, 0)$ to the point $(1, 1)$: $(0,0)$ → $(0,1)$ → $(1,1)$ and $(0,0)$ → $(1,0)$ → $(1,1)$, so $f(1,1)=2$.\nSimilarly, $f(1,2)=3$, $f(2,1)=3$, and $f(2,2)=6$. Thus, the sum is $14$."},{"iden":"sample input 2","content":"314 159 2653 589"},{"iden":"sample output 2","content":"602215194"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}