There are $n$ cities in Berland, and they are connected by two railroads — the Main railroad and the Auxiliary railroad. Each city has two railway stations, one connected to the Main railroad (called the Main station), and the other connected to the Auxiliary railroad.

The railroads are identical in their structure. The Main railroad consists of $n-1$ railroad segments; the $i$-th railroad segment connects the Main station of the city $i$ with the Main station of the city $i+1$. Similarly, the Auxiliary railroad consists of $n-1$ railroad segments; the $i$-th railroad segment connects the Auxiliary station of the city $i$ with the Auxiliary station of the city $i+1$.

These railroads are used to transfer different goods and resources from one city to another. In particular, the Ministry of Energetics is interested in using these railroads to transfer coal.

The Ministry has estimated the following capabilities of the railroads:

• for every $i \in [1, n-1]$, at most $a_i$ tons of coal per day can be transferred from the Main station $i$ to the Main station $i+1$ (only in this direction);
• for every $i \in [1, n-1]$, at most $b_i$ tons of coal per day can be transferred from the Auxiliary station $i$ to the Auxiliary station $i+1$ (only in this direction);
• for every $i \in [1, n]$, at most $c_i$ tons of coal per day can be transferred from the Main station $i$ to the Auxiliary station $i$, or in the opposite direction.

To analyze the capacity of the whole railroad network, the Ministry requires a software that would process and answer queries of the following format:

• calculate the maximum number of tons of coal that can be transferred per day from the Main station $l_i$ to the Main station $r_i$.

Your task is to implement this software.

The first line contains one integer $n$ ($2 \le n \le 3 \cdot 10^5$) — the number of cities.

The second line contains $n-1$ integers $a_1, a_2, \dots, a_{n-1}$ ($1 \le a_i \le 10^9$).

The third line contains $n-1$ integers $b_1, b_2, \dots, b_{n-1}$ ($1 \le b_i \le 10^9$).

The fourth line contains $n$ integers $c_1, c_2, \dots, c_{n}$ ($1 \le c_i \le 10^9$).

The fifth line contains one integer $q$ ($1 \le q \le 3 \cdot 10^5$) — the number of queries.

Then $q$ lines follow, the $i$-th line contains two integers $l_i$ and $r_i$ ($1 \le l_i < r_i \le n$) — the parameters of the $i$-th query.

Print $q$ integers, where the $i$-th integer should be the answer to the $i$-th query, i. e. the maximum number of tons of coal that can be transferred per day from the Main station $l_i$ to the Main station $r_i$.