input: Write a function to find the consecutive integers in a given list whose sum equals a specified integer k. The function should return the sublist of these consecutive integers. If no such sublist exists, return -1. If the given integer k is greater than the sum of the list or less than 0, return -1.
  
  def find_consecutive_integers(lst, k):
      # Edge cases
      if k > sum(lst) or k < 0:
          return -1
   
      # Create a window and move it's boundaries
      l, h, curr_sum = 0, 0, 0
      while h < len(lst):
          # Sum of current window
          curr_sum += lst[h] 
   
          # See if the window sum equals k
          while curr_sum > k and l <= h:
              curr_sum -= lst[l]
              l += 1
   
          # When window sum is equal to k, return the window
          if curr_sum == k:
              return lst[l:h+1]
   
          # Move the window one step at a time
          h += 1
   
      # If window size reaches last element and no window is 
      # found
      return -1
  
  assert find_consecutive_integers([1,3,5,7,9], 10) == [3,5,7]
  assert find_consecutive_integers([1,2,3,4,5], 9) == [2,3,4]
  assert find_consecutive_integers([3,4,5,6], 18) == [3,4,5,6]
  assert find_consecutive_integers([1,2,3], 10) == -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