input: Write a function to find the consecutive integers in a given list whose sum equals a specified integer k. If no such sequence exists, return -1. Handle edge cases where k is greater than the sum of the list or less than 0.
  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, 2, 3, 4, 5], 1) == [1]
  assert find_consecutive_integers([1, 2, 3, 4, 5], 20) == -1
  assert find_consecutive_integers([], 5) == -1
output: def find_consecutive_integers(lst, k):
      if k < 0 or sum(lst) < k:
          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