PERMUN  Permutation
You will be given a permutation of first N natural numbers.Then you will be asked to print the smallest index of the array which contains the number between a given range(inclusive).Refer IputOutput for more details.
Input
First line contains two integers N and Q separated by a space.
Second line contains N integers separeted by a space.(From 1 to N in any order)
Now Q line follows :Each line contains two integers A and B separated by space.
Output
You must Output exactly Q lines each containg the answer.
Constraint:
N<=100000,Q<=100000,A<=B<=100000.
Example
Input:
2 2 2 1 1 2 1 12 22 1
Output: 1 2
hide comments
Samil Vargas:
20131221 01:35:38
Last edit: 20140120 04:40:56 

NeW AcP:
20130904 04:43:57
nice problem .it is not that trivial to be moved in tutorial. 

:D:
20130904 04:43:57
It's really pointless to delete "move to tutorial" comments. I'm checking new problems regardless and assessing on my own.


MR. BEAN :
20130904 04:43:57
1st user of this problem :) 
Added by:  devu 
Date:  20120814 
Time limit:  0.105s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  Surendra Baswana 