input: Write a function to find the consecutive integers in a given list whose sum is equal to a specified integer k. If no such sublist exists, return -1. If the specified sum k is greater than the sum of the entire list or less than 0, return -1.
  assert find_consecutive_integers([1,3,5,7,9], 10) == [3,5,7]
  assert find_consecutive_integers([1,3,5,7,9], 15) == [1,3,5,7]
  assert find_consecutive_integers([1,3,5,7,9], 25) == -1
  assert find_consecutive_integers([1,3,5,7,9], 0) == -1
  assert find_consecutive_integers([], 10) == -1
output: def find_consecutive_integers(lst, k):
      if k > sum(lst) or k < 0:
          return -1
      for i in range(len(lst)):
          current_sum = 0
          for j in range(i, len(lst)):
              current_sum += lst[j]
              if current_sum == k:
                  return lst[i:j+1]
              elif current_sum > k:
                  break
      return -1