#include<bits/stdc++.h>
using namespace std;
const int N = 100050;
int n, m;
int a[N], tree[4 * N];

void build_tree(int node, int start, int end){
  if(start == end){
    tree[node] = a[start];
    return ;
  }
  int mid = (start + end) / 2;
  int left_node  = 2 * node;
  int right_node = 2 * node + 1;
  build_tree(left_node, start, mid);
  build_tree(right_node, mid + 1, end);
  tree[node] = min(tree[left_node], tree[right_node]);
}

int query_tree(int node, int start, int end, int L, int R){
  if(L <= start && end <= R){
    return tree[node];
  }
  int mid = (start + end) / 2;
  int ans = INT_MAX;
  int left_node  = 2 * node;
  int right_node = 2 * node + 1;
  if(R <= mid){
    ans = min(ans, query_tree(left_node, start, mid, L, R));
  }
  if(L > mid) {
    ans = min(ans, query_tree(right_node, mid + 1, end, L, R));
  }
  return ans;
}

int main(){
  cin >> n >> m;
  for(int i = 1;i <= n;i++){
    cin >> a[i];
  }
  build_tree(1, 1, n);
  while(m--){
    int a, b;
    cin >> a >> b;
    cout << query_tree(1, 1, n, a, b) << " ";
  }
  return 0;
}