freeway_length, test_cases = $stdin.gets.chomp.split(' ').collect{ |x| x.to_i }
freeway_segments = $stdin.gets.chomp.split(' ').collect{ |x| x.to_i }


test_cases.times do
  startpos, endpos = $stdin.gets.chomp.split(' ').collect{ |x| x.to_i }

  puts freeway_segments[startpos..endpos].min
end

list_1_length = $stdin.gets.to_i

list1 = $stdin.gets.chomp.split(' ')

list_2_length = $stdin.gets.to_i

list2 = $stdin.gets.chomp.split(' ')

list1hash = {}
list2hash = {}

times = list_1_length > list_2_length ? list_1_length : list_2_length

times.times do |i|
  if list1[i] != nil
    n = list1[i]
    if list1hash[n] == nil
      list1hash[n] = 1
    else
      list1hash[n] += 1
    end
  end

  if list2[i] != nil
    n = list2[i]
    if list2hash[n] == nil
      list2hash[n] = 1
    else
      list2hash[n] += 1
    end

  end
end

if list1hash.length > list2hash.length
  biggest = list1hash
  smallest = list2hash
else
  smallest = list1hash
  biggest = list2hash
end

arr = []
biggest.each do |k, v|
  arr << k.to_i if smallest[k] != v
end

puts arr.sort.join(' ')

def lonelyinteger(array)
  found = []

  array.each do |i|
    if found[i] == nil
      found[i] = 1
    elsif found[i] == 1
      found.delete(i)
    end
  end

  puts found.first
end

a = gets.strip.to_i
b = gets.strip.split(" ").map! {|i| i.to_i}
print lonelyinteger(b)

test_cases = $stdin.gets.chomp.to_i

test_cases.times do
  cuts = $stdin.gets.chomp.to_i
  h = cuts / 2
  v = cuts - h
  puts h * v
end

def palindrome?(string)
  hash = {}

  string.each_char do |c|
    if hash[c] == nil
      hash[c] = 1
    else
      hash[c] += 1
    end
  end

  odd_chars = 0

  hash.each do |k,v|
    unless v % 2 == 0
      odd_chars += 1
      if odd_chars >= 2
        puts 'NO'
        return
      end
    end
  end

  puts 'YES'
end

string = $stdin.gets.chomp

palindrome?(string)

jars, moves = $stdin.gets.chomp.split(' ').collect { |x| x.to_i}
total = 0
moves.times do |x|
  jar1, jar2, ammount = $stdin.gets.chomp.split(' ').collect { |x| x.to_i }
  no_of_jars = (jar2 - jar1) + 1

  total = total + ( no_of_jars * ammount )
end

puts (total / jars).floor

  n = gets.to_i
  k = gets.to_i
  candy = []
  n.times do |i|
    candy[i] = gets.to_i
  end

  candy.sort!

  # sliding widow
  j = k
  i = 0
  lowest_dif = Float::INFINITY

  while j <= candy.length do
    dif = candy[j - 1] - candy[i]
    lowest_dif = dif if dif < lowest_dif

    break if lowest_dif == 0

    j += 1
    i += 1
  end

  puts lowest_dif

test_cases = $stdin.gets.chomp.to_i

test_cases.times do
  years = $stdin.gets.chomp
  sum = 1
  years.to_i.times do |i|
    if i % 2 == 0
      sum *= 2
    else
      sum += 1
    end
  end
  $stdout.puts sum
end

def largest_decent_number(n)
  return -1 if n == 1 || n == 2

  j = 0
  loop do
    break if n - j <= 2

    if (n - j) % 3 == 0
      return "#{'5' * (n - j) }#{'3' *  j }"
    end
    j += 5
  end

  if (n % 5 == 0)
    '3' * n
  else
    -1
  end
end

test_cases = $stdin.gets.to_i

test_cases.times do
  value = $stdin.gets.to_i

  $stdout.puts largest_decent_number(value)
end

def fibonachi_upto(n)
  return 0 if n == 0
  return 1 if n == 1
  return 1 if n == 2
  prev2 = 1
  prev1 = 1

  a = [0, 1, 1]
  i = 3

  while prev1 <= n do
    tmp = prev1 + prev2
    a << tmp if tmp <= n
    prev2 = prev1
    prev1 = tmp
    i += 1
  end

  return a
end


fibos = fibonachi_upto(10000000000)

test_cases = $stdin.gets.to_i

test_cases.times do
  value = $stdin.gets.to_i
  if fibos.include?(value)
    puts 'IsFibo'
  else
    puts 'IsNotFibo'
  end
end