Solve this question please my friends

See more:

C++14

Because Jake got an early offer from UOIT, his overjoyed parents gave him a lot of Rubik's Cubes as a reward. However, he soon developed Carpal Tunnel Syndrome, and now has to sell some of his cubes at half of their original price to pay for his medical bills.
Jake is a very unique person; the N cubes that he got each have a distinct value Vi, and are placed in a straight line. He wants to know if he has a total of at least M dollars after he sells all of his cubes inclusively between the one valued at Va and the one valued at Vb (in the line). He specifically wants to ask Q questions in the form (Va,Vb) to know if he has enough money after selling all of the cubes in that range. Both cubes are guaranteed to exist in the sequence.
Note: it may be helpful to use unsigned 64-bit variables (e.g. unsigned long long in C++).

Constraints
Subtask 1 [10%]
• 1≤N, Q≤100
• 1≤M, V≤1000

Subtask 2 [90%]
• 1≤N,Q≤100000
• 1≤M≤10000000
• 1≤V≤1000000

Input Specification
The first line of input will consist of 3 space-separated integers N, M, and Q. The next line will contain N space-separated integers, where the ith integer represents the Vith value. For the next Q lines, each line will contain 2 space separated integers Va and Vb.

Output Specification
For each question, output Enough if jake can afford his bills or Not enough if he cannot.

Sample Input

5 10 2
10 1 4 3 7
1 3
10 7

Sample Output

Not enough
Enough

What I have tried:

I'm not specefically looking for a code but wondering if someone can explain what the question is exactly asking. I just started coding about 48 hours ago, and realized I do not really understand the format of questions present on some website.

From what I can understand I have several cubes in a line, each with a respective value of V. Each cube (or vi, vi+1, vi+2... vi+n) has a money value. In subsets of VA to VB which can be as large as 100 (q<= 100) i add them sequentially. The subest procudes a value of (lets say) R. I then check the value of R to be either greater than M or less than M. If it is less than R, than I loop back to the begining and try with a different subset. If the value of R is equal to or greater than M, then i set the counter to 1 and repeatthe entire loop until the value of the counter is equal to Q. This is what I understand but not sure if this is what it is asking, can some one help to clarify?