input: Write a function to find the consecutive integers in a list whose sum is equal to a 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
  lst = [1,3,5,7,9]
  k = 10
  print(find_consecutive_integers(lst, k)) # Output: [3,5,7]
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