input: Write a function to find the consecutive integers in a given list whose sum equals a given integer k. If no such consecutive integers exist, return -1. If the given integer k is greater than the sum of all elements in the list or less than 0, return -1. The function should return the list of consecutive integers whose sum equals k.
  
  def find_consecutive_integers(lst, k):
      if k > sum(lst) or k < 0:
          return -1
      l, h, curr_sum = 0, 0, 0
      while h < len(lst):
          curr_sum += lst[h]
          while curr_sum > k and l <= h:
              curr_sum -= lst[l]
              l += 1
          if curr_sum == k:
              return lst[l:h+1]
          h += 1
      return -1
  
  assert find_consecutive_integers([1,3,5,7,9], 10)==[3,5,7]
  assert find_consecutive_integers([1,2,3,4,5], 10)==[1,2,3,4]
  assert find_consecutive_integers([1,2,3,4,5], 11)==[2,3,4,5]
  assert find_consecutive_integers([1,2,3,4,5], 12)==-1
  assert find_consecutive_integers([1,2,3,4,5], 0)==-1
  assert find_consecutive_integers([], 5)==-1
output: def find_consecutive_integers(lst, k):
      if k > sum(lst) or k < 0:
          return -1
      l, h, curr_sum = 0, 0, 0
      while h < len(lst):
          curr_sum += lst[h]
          while curr_sum > k and l <= h:
              curr_sum -= lst[l]
              l += 1
          if curr_sum == k:
              return lst[l:h+1]
          h += 1
      return -1