input: Write a function to find the consecutive integers in a list that sum up to a given integer k. If such a contiguous subarray exists, return the subarray. If not, return -1 if the sum is greater than the list sum or less than 0. If the list is empty, return an empty list.
  assert find_consecutive_integers([1, 3, 5, 7, 9], 10) == [1, 3, 5, 7]
  assert find_consecutive_integers([1, 2, 3, 4, 5], 9) == [2, 3, 4]
  assert find_consecutive_integers([1, 2, 3], 10) == -1
  assert find_consecutive_integers([1, 3, 5, 7, 9], -1) == -1
  assert find_consecutive_integers([], 5) == []
output: def find_consecutive_integers(lst, k):
      if not lst:
          return []
      total_sum = sum(lst)
      if k > total_sum 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