RPLN - Negative Score

Orianna is a great swimmer and she's going to a swimming competition this month and needs your help as she is highly paranoic about the results of the competition.

The competition consists in some sort of evaluations, every judge makes a score and, based on that score and the score of other contestants she will get a score belonging to her results, those scores are final, meaning that will not change in the competition.

Orianna requires this solution with urgency, she is getting evaluated on a lot of ways and she is very worried about her results, so she wants to know what is the worst score from an evaluation A to other evaluation B inclusive.

Input

The first line of the test data will start with an integer T representing the T test cases, then, T cases will follow, each of the cases starts with two integers N and Q, denoting the number of evaluations Orianna had, then, N integers will follow denoting the score on each evaluation, after that, Q queries will begin, each query consist on two integers A and B.

Output

You must output the string “Scenario #i:“, a blank line and then the result of each query, remember, Orianna is interested on the worst score from evaluation A to evaluation B inclusive.

Example

Input:
2
5 3
1 2 3 4 5
1 5
1 3
2 4
5 3
1 -2 -4 3 -5
1 5
1 3
2 4

Output:
Scenario #1:
1
1
2
Scenario #2:
-5
-4
-4

Constraints

  • 1 <= T <= 100

Small input (30%):

  • 1 <= N <= 1,000
  • 1 <= Q <= 1,000
  • -10^9 <= Ni <= 10^9
  • 1 <= A <= B <= N

Large input (70%):

  • 1 <= N <= 100,000
  • 1 <= Q <= 100,000
  • -10^9 <= Ni <= 10^9
  • 1 <= A <= B <= N

Solutions rejudged due to weak test cases.


Added by:david_8k
Date:2012-06-22
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:Own Problem used for the RPL contest

hide comments
2019-04-20 18:44:51
AC using sqrt decomposition
2019-04-12 20:54:04
cakewalk ;P
2018-10-04 20:55:45
take care of that scanerio part otherwise it will fuck you :(
2018-04-06 20:02:40
Done with Sparse Table :) take care of size to avoid runtime error!
2017-12-19 15:27:02
handle the case l>r and use 1e9+1 as the infinite value...can use segment tree or sparse table
2017-09-18 18:53:22
What the heck?
Python3.5 gives TLE while CPP14 got AC.
2017-08-28 18:30:03
Anybody Did it in Java? Getting TLE in java, AC in C++
2017-08-08 07:36:18
forgot the scenario... '-'

Last edit: 2017-08-08 07:36:30
2017-07-24 14:27:10
take care of the part “Scenario #i:" i got 10 wrong answer because of this thinking my code is wrong, so be careful
2017-07-09 09:45:51
AC in one go, just find the minimum in the given range using segment tree
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.