#### My Younger Sister

**Author: ** QuwsarOhi

Problem Setter:M M Mehedi HasanIntake 33, Department of CSE

Do
you like chocolates? Maybe, or not, but my younger sister likes chocolates
so much and she wants to buy more chocolates. Every day she comes to me with a
list of chocolates of **N** types from **1** to **N**, where the price is given of every type of chocolates. Finally,
she askes me what amount of money she will need if she wants to buy chocolates
from **L** to **R** positions?

I heard that you are a good programmer of BUBT. So, you
should write a program, which gives the total price of chocolates from **L** to **R** positions.

#### Input Format

In the first line, you are given one
integer **N** (1 <= **N** <= 10^{5}) denoting the total number
of different chocolates. The second line contains **N** number of integers like as, * P_{1}, P_{2}, P_{3}, ..., P_{n. }*Here

*P*_{i}_{ }(1<=

**P**

_{i}<=10

^{5})denotes the price of i

^{th }chocolate.

In the third line, you are given one
integer **T** (1 <= **T** <= 10^{5}), which is the number of
test cases. In each test case, you are given two integers **L** and **R** (1 <= L <= R <= N).

#### Output Format

You should
write a program, which gives the total price of chocolates from position **L** to **R** for each test case. Print the output of each test case in a
separate line.

#### Samples

###### Input

###### Output

Language | Time | Memory |

GNU C 11 | 2s | 512MB |

GNU C++ 14 | 2s | 512MB |

GNU C++ 11 | 2s | 512MB |

PHP 7 | 1s | 1024MB |

Java (OpenJDK 8) | 1s | 4096MB |