Range Sum

You are given an array ‘arr’ of size ‘N’. You are provided with ‘Q’ queries, each containing two integers, ‘L’ and ‘R’. Your task is to return the sum of elements from the position ‘L’ to ‘R’ for each query.

For example:

You are given arr = [1, 3, 4, 5, 6, 9], and queries = [[1, 3], [5, 6] , [1, 6]].

For the first query [1, 3] sum of elements = 1 + 3 + 4 = 8. Hence the answer is 8

For the second query [5, 6] sum of elements = 6 + 9 = 15. Hence the answer is 15

For the third query [1, 6] sum of elements = 1 + 3 + 4 + 5 + 6 + 9= 28. Hence the answer is 28. 

Hence the final answer is [8, 15, 28]

Input Format:

The first line contains an integer 'T' which denotes the number of test cases.

The first line of each test case contains two space-separated integers, ‘N’ and ‘Q’, denoting the size of the array and the number of queries.

The second line contains ‘N’ space-separated integers representing the elements of the array ‘arr’.

The next ‘Q’ lines contain two space-separated integers, ‘L’ and ‘R’ representing each query.

Output Format:

For each test case, print ‘Q’ space-separated integers, denoting the sum of elements for each query.

The output of each test case will be printed in a separate line.

Constraints:

1 <= T <= 10 
1 <= N, Q <= 10 ^ 6
0 <= arr[i] <= 10 ^ 8
1 <= L <=  R <= N

Time limit: 1 sec

Note:

You do not need to input or print anything, as it has already been taken care of. Just implement the given function.