input: Write a function to find the consecutive integers in the given list whose sum is equal to the given integer k. If no such consecutive integers exist, return -1.
  
  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) == [1,3,6]
  assert find_consecutive_integers([1,2,3,4], 7) == [3,4]
  assert find_consecutive_integers([1,2,3,4], 10) == -1
  assert find_consecutive_integers([], 5) == -1
  assert find_consecutive_integers([5], 5) == [5]
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